n = int(eval(input()))

a = list(map(int, input().split()))





def factorization(n):

    arr = []

    temp = n

    for i in range(2, int(-(-n**0.5//1))+1):

        if temp%i==0:

            cnt=0

            while temp%i==0:

                cnt+=1

                temp //= i

            arr.append([i, cnt])



    if temp!=1:

        arr.append([temp, 1])



    if arr==[]:

        arr.append([n, 1])



    return arr





for i in a:

    if i%2 == 1:

        print((0))

        exit()



l = []

for i in a:

    l.append(factorization(i))



ans = 10 ** 9

for i in l:

    if i[0][0] == 2:

        ans = min(i[0][1], ans)



print(ans)
n = int(eval(input()))

a = list(map(int, input().split()))



cnt = 0

while True:

    for i in range(n):

        if a[i] % 2 == 0:

            a[i] = a[i] // 2

        else:

            break

    else:

        cnt += 1

        continue

    break



print(cnt)
n = int(eval(input()))
a = list(map(int, input().split()))


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-(n**0.5) // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])
    if temp != 1:
        arr.append([temp, 1])
    if arr == []:
        arr.append([n, 1])
    return arr


for i in a:
    if i % 2 == 1:
        print((0))
        exit()
l = []
for i in a:
    l.append(factorization(i))
ans = 10**9
for i in l:
    if i[0][0] == 2:
        ans = min(i[0][1], ans)
print(ans)

n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 0
while True:
    for i in range(n):
        if a[i] % 2 == 0:
            a[i] = a[i] // 2
        else:
            break
    else:
        cnt += 1
        continue
    break
print(cnt)

- - -def factorization(n): -    arr = [] -    temp = n -    for i in range(2, int(-(-(n**0.5) // 1)) + 1): -        if temp % i == 0: -            cnt = 0 -            while temp % i == 0: -                cnt += 1 -                temp //= i -            arr.append([i, cnt]) -    if temp != 1: -        arr.append([temp, 1]) -    if arr == []: -        arr.append([n, 1]) -    return arr - - -for i in a: -    if i % 2 == 1: -        print((0)) -        exit() -l = [] -for i in a: -    l.append(factorization(i)) -ans = 10**9 -for i in l: -    if i[0][0] == 2: -        ans = min(i[0][1], ans) -print(ans) +cnt = 0 +while True: +    for i in range(n): +        if a[i] % 2 == 0: +            a[i] = a[i] // 2 +        else: +            break +    else: +        cnt += 1 +        continue +    break +print(cnt)