Problem:
Score : 200 points

Problem 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.

Constraints

1 ≤ N ≤ 100

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

7

Sample Output 1

4

4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.

Sample Input 2

32

Sample Output 2

32

Sample Input 3

1

Sample Output 3

1

Sample Input 4

100

Sample Output 4

64

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Linq;
using System.IO;
using System.Text;
using System.Collections;
using System.Collections.Generic;
using System.Text.RegularExpressions;

namespace AtCoder.ABC068
{
    class Program
    {
        static void Main()
        {
            int n = int.Parse(Console.ReadLine());
            int[] cnt = new int[n + 1];
            for (int i = 2; i <= n; i++)
            {
                Calc(i);
            }
            var result = count.Select((val, idx) => new { Value = val, Index = idx })
                            .OrderByDescending(elem => elem.Value)
                            .First().Index;
            Console.Error.WriteLine(string.Join(" ", count));
            Console.WriteLine(result);
        }

        static int[] count = new int[101];
        static int Calc(int n)
        {
            if (count[n] != 0) return count[n];
            else if (n % 2 != 0 || n == 0)
            {
                count[n] = 0;
                return 0;
            }
            else
            {
                count[n] = Calc(n / 2) + 1;
                return count[n];
            }
        }
    }
}