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.

Examples

Input

3
8 12 40


Output

2


Input

4
5 6 8 10


Output

0


Input

6
382253568 723152896 37802240 379425024 404894720 471526144


Output

8
# -*- coding: utf-8 -*-
N = int(raw_input()) #Ｎの整数を入力
A = map(int, raw_input().split()) #N個の正の整数Ａを入力
Count = 0 #何回操作したか
while True: #奇数になるまでループ
  f = 0 #奇数になったら１にする
  for i in range(N): #A[0]~A[N]まで/2をする
    if A[i] %2 != 0:f = 1 #奇数だったら1にする
    A[i]=A[i]/2 #/2をする
  if f==1:break #ループを抜ける
  Count += 1 #全ての個数が偶数なら+1
print Count #結果