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.
from functools import reduce

N = int(input())
A = list(map(int, input().split()))

print(A)

cnt = 0
while reduce(lambda x, y: x and y, [n % 2 == 0 for n in A]):
    A = [n // 2 for n in A]
    cnt += 1

print(cnt)

from functools import reduce

N = int(input())
A = list(map(int, input().split()))

cnt = 0
while reduce(lambda x, y: x and y, [n % 2 == 0 for n in A]):
    A = [n // 2 for n in A]
    cnt += 1

print(cnt)
