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

num_list = [int(i) for i in input().split()]

cnt = 0
flag = True

while flag:
    for i in range(N):
        if num_list[i] % 2 == 1:
            flag = False
            break
        else:
            num_list[i] = num_list[i] / 2
            
    cnt += 1

print(cnt)


N = int(input())

num_list = [int(i) for i in input().split()]

cnt = 0
flag = True

while flag:
    for i in range(N):
        if num_list[i] % 2 == 1:
            flag = False
            break
        else:
            num_list[i] = num_list[i] / 2
            if i == N - 1:
                cnt += 1

print(cnt)
