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.
N = int(input())
A_list = list(map(int, input().split()))
A_list = sorted(A_list)
flag = True
cnt = 0
for i in range(N):
    if A_list[i]%2!=0:
        flag=False
        break
if flag:
    while (1):
        A_list[0]/=2
        cnt += 1
        if A_list[0]==1:
            break
print(cnt) if flag else print(0)
import numpy as np
N = int(input())
A_list = list(map(int, input().split()))
flag = True
cnt = 0
while(flag):
    for i in range(N):
        if A_list[i]%2!=0:
            flag=False
            break
        A_list[i]/=2
    cnt+=1
print(cnt-1)