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())

numlist = input().split()
# numlist = map(int,input().split())

print(N,numlist)

def div(list):
    ret = []
    for i in list:
        ret.append(int(i)/ 2)
    return ret

def chkEven(list):
    for i in list:
        if not int(i) % 2 == 0:
            return False
    return True

cnt = 0


while chkEven(numlist):
    cnt += 1
    numlist = div(numlist)
    print('xxx: ',numlist)

print(cnt)
N = int(input())

numlist = input().split()
# numlist = map(int,input().split())

# print(N,numlist)

def div(list):
    ret = []
    for i in list:
        ret.append(int(i)/ 2)
    return ret

def chkEven(list):
    for i in list:
        if not int(i) % 2 == 0:
            return False
    return True

cnt = 0


while chkEven(numlist):
    cnt += 1
    numlist = div(numlist)
    
print(cnt)