Isolate the Rightmost Bit
You are given an integer
Write a program that prints two integers: the value of the rightmost bit and the value of the original number with its rightmost bit removed.
For example, consider the number 29, which in binary is 11101. The rightmost bit is 1, and after erasing it, the number becomes 1110, which is equal to 14 in base-10.
Input
The first line contains a single integer .
Output
Two integers separated by a space: the rightmost bit in binary representation of and the value of with its rightmost bit completely erased (in base-10).
Examples
Input | Output |
29 | 1 14 |
18 | 0 9 |
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB