n = int(eval(input()))

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



ans = 0

flag = True

while flag:

    for i in range(n):

        if a[i] % 2 == 1:

            flag = False

            break

        else:

            a[i] /= 2

    ans += 1

print((ans-1))

def count_of_div(n):

    ret = 0

    while n % 2 == 0:

        n /= 2

        ret += 1

    return ret





n = int(eval(input()))

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

ans = min(list(map(count_of_div, a)))

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

def count_of_div(n):
    ret = 0
    while n % 2 == 0:
        n /= 2
        ret += 1
    return ret


n = int(eval(input()))
a = list(map(int, input().split()))
ans = min(list(map(count_of_div, a)))
print(ans)

+def count_of_div(n): +    ret = 0 +    while n % 2 == 0: +        n /= 2 +        ret += 1 +    return ret + + -ans = 0 -flag = True -while flag: -    for i in range(n): -        if a[i] % 2 == 1: -            flag = False -            break -        else: -            a[i] /= 2 -    ans += 1 -print((ans - 1)) +ans = min(list(map(count_of_div, a))) +print(ans)