output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = int(input())
  counter = -1
  number = 0
  for i + 1 in range(N):
      k = i
      now_counter = 0
      while k % 2 == 0:
          now_counter += 1
          k /= 2
      if now_counter > counter:
          number = i
  print(number)
  
problem_description: Statement
  
  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,
  
    * 6 can be divided by 2 once: 6 -> 3.
    * 8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.
    * 3 can be divided by 2 zero times.
samples: [{"input": "7", "output": "4\n    \n\n4 can be divided by 2 twice, which is the most number of times among 1, 2,\n..., 7.\n\n* * *"}, {"input": "32", "output": "32\n    \n\n* * *"}, {"input": "1", "output": "1\n    \n\n* * *"}, {"input": "100", "output": "64"}]