simple-fun-number-11-swap-adjacent-bits

Simple Fun #11: Swap Adjacent Bits

Task

You are given a 32-bit integer n. Swap each pair of adjacent bits in its binary representation and return the result as a decimal number.

The potential leading zeroes of the binary representations have to be taken into account, e.g. 0b100 as a 32-bit integer is 0b00000000000000000000000000000100 and is reversed to 0b1000.

Examples

For n = 13, the output should be 14:

13₁₀ = 1101₂ --> 1110₂ = 14₁₀

For n = 74, the output should be 133:

74₁₀ = 01001010₂ --> 10000101₂ = 133₁₀

Input/Output

• [input] integer n 0 ≤ n < 2^30.

• [output] an integer