Given a positive integer N, transform it into its unsigned binary representation (e.g. 10 => 1010). Your program needs to check the each bit of binary representation A . Accroding to the left bit ,if the left bit is 0 you don't do anything .if the left bit is 1 then 1 ->0 or 0->1(the left-most bit accroding to the right-most bit) So you can transform A into a another binary representation B.
Example:
1011 -> 0110
The input consist of an integer N (2 <= N <= 1024)
Output the binary representation of N and transform A into a another binary representation B. Those two numbers are separated by a space. Note that you do not need to print ‘\n’ at the end of the output.