Problem:
Score : 200 points

Problem Statement

There are N positive integers written on a blackboard: A_1, ..., A_N.

Snuke can perform the following operation when all integers on the blackboard are even:

Replace each integer X on the blackboard by X divided by 2.

Find the maximum possible number of operations that Snuke can perform.

Constraints

1 \leq N \leq 200

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible number of operations that Snuke can perform.

Sample Input 1

3
8 12 40

Sample Output 1

2

Initially, [8, 12, 40] are written on the blackboard.
Since all those integers are even, Snuke can perform the operation.

After the operation is performed once, [4, 6, 20] are written on the blackboard.
Since all those integers are again even, he can perform the operation.

After the operation is performed twice, [2, 3, 10] are written on the blackboard.
Now, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.

Thus, Snuke can perform the operation at most twice.

Sample Input 2

4
5 6 8 10

Sample Output 2

0

Since there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.

Sample Input 3

6
382253568 723152896 37802240 379425024 404894720 471526144

Sample Output 3

8

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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
    public class Program
    {
        public static void Main(string[] args)
        {
            Program p = new Program();
            var n = int.Parse(System.Console.ReadLine());
            int[] aList = System.Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var counter = 0;
            var allEven = true;

            var result = p.Divide2(n, aList, allEven, counter);

            System.Console.WriteLine(result.ToString());


        }

        /// <summary>
        /// 引数が偶数か奇数か判定
        /// 偶数　→　true
        /// </summary>
        /// <param name="_number"></param>
        /// <returns></returns>
        public bool OddOrEven(int _number)
        {
            if (_number % 2 == 0) return true;
            else return false;
        }


        /// <summary>
        /// _aList全てが偶数か奇数か
        /// </summary>
        /// <param name="_n"></param>
        /// <param name="_aList"></param>
        /// <param name="_allEven"></param>
        /// <returns></returns>
        public bool AllOddOrEven(int _n, int[] _aList, bool _allEven)
        {
            for (int a = 0; a < _n; a++)
            {
                
                if (!OddOrEven(_aList[a]))
                {
                    _allEven = false;
                    break;
                }
            }

            return _allEven;
        }


        /// <summary>
        /// 2で割る
        /// </summary>
        /// <param name="_n"></param>
        /// <param name="_aList"></param>
        /// <param name="_allEven"></param>
        /// <param name="_counter"></param>
        public int Divide2(int _n, int[] _aList, bool _allEven, int _counter)
        {
            if (AllOddOrEven(_n, _aList, _allEven))
            {
                for (int i = 0; i < _n; i++)
                {
                    _aList[i] = _aList[i] / 2;
                }
                _counter = _counter + _n;

                Divide2(_n, _aList, AllOddOrEven(_n, _aList, _allEven), _counter);
            }

            return _counter;
        }
    }
}