Problem1690--change of position

1690: change of position

[Creator : ]
Time Limit : 1 sec  Memory Limit : 128 MB

Description

Give you a positive integer less than 2^32. This number can be represented as a 32-bit binary number (less than 32 bits are made up of 0). We call the first 16 bits of this binary "high order" and the last 16 bits "low order". By swapping the high and low bits, we can get a new number. Ask what the new number is (in decimal).

For example, the number 1314520 is expressed in binary as 0000 0000 0001 0100 0000 1110 1101 1000 (adding 11 leading zeros makes up 32 bits), among which the first 16 bits are the highest ones, i.e. 0000 0000 0001 0100; The last 16 bits are the lower ones, meaning 0000, 1110, 1101, 1000. By swapping the high and low bits, we get a new binary number 0000, 1110, 1101, 1000, 0000, 0000, 0001, 0100. It is the decimal 249036820.

Input

A positive integer less than 2^32

Output

Output the new number

Sample Input Copy

1314520

Sample Output Copy

249036820

Source/Category