Score : 200 points
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.
For example,
Input is given from Standard Input in the following format:
N
Print the answer.
7
4
4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.
32
32
1
1
100
64