# Cycle shifts

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Lets write the decimal integer n in binary notation and create all its left cycle shifts where first digit of the number goes to the end.

For example, if n = 11, than it will be 1011 in binary notation, cycle shifts are 0111, 1110, 1101, 1011. So the maximal value m among all received numbers equals to `1110[2]`

= `14[10]`

.

For the number n find the maximal value of m.

## Input

One number n (1 ≤ n ≤ 2 ·`10^9`

).

## Output

One number m.

## Examples

Input #11

Answer #11

Submissions 15K

Acceptance rate 43%