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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;

public class Main {
    public static void main(String args[]){
        //入力値を受け取る
        Scanner scanner = new Scanner(System.in);
        //1行目(数字の個数) ex:3
        int num1 = Integer.parseInt(scanner.next());
        //2行目(いくつかの整数のグループ) ex:8 12 40
        String num2 = scanner.next();
        String[] nums = num2.split(" ", 0); //ex:[8,12,40]
        
        //整数の配列操作用の配列 ex:[2,1,0]
        int[] index = new int[num1];
        for(int i = 0; i > num1-1; i++){
            index[i] = num1-1;
            num1 = num1-1;
        }
        //すぬけ君が操作を行うことができる最大回数
        int count = 0;
        //numsを一つずつ偶数か確認
        boolean isEven = true;
        while(isEven){
            for(int i = 0; 1 > index.length; i++){
                int testNum = Integer.parseInt(nums[index[i]]);
                isEven = testNum % 2 == 0;
                if(!isEven){
                    break;
                }
                nums[index[i]] = String.valueOf(testNum/2);
                count++;
            }
        }
        System.out.println(count);
    }
}