Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))
s = 0
def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
count = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        A[i] = A[i] // 2
        s += 1
print(s)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
count = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        A[i] = A[i] // 2
        s += 1
print(count)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
count = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        elif:
            A[i] = A[i] // 2
            s += 1
            continue
print(count)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
count = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        elif:
            A[i] = A[i] // 2
            s += 1
            continue
    
    break
print(count)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
count = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
        elif:
            A[j] = A[j] // 2
            s += 1
            continue
    
    break
print(count)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))
s = 0
while True:
    for i in range(n):
        if (A[i] // 2 == 1) or (A[i] == 0):
            break
    for j in range(n):
        A[j] = A[j] / 2
    s+=1
print(s)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))
s = 0
while True:
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            break
    for j in range(n):
        A[j] = A[j] / 2
    s+=1
print(s)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
list = [int(input()) for h in range(n) ]
s = 0
while True:
    for i in range(n):
        if list[i] % 2 == 1:
            break
    for j in range(n):
        list[j] = list[j] / 2
    s = s + 1
print(s)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
list = [int(input()) for num in range(n) ]
m = min(list)
a = 0
while True:
    m = m / 2
    if m <= 1:
        break
    a = a + 1
print(a)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
list = [int(input()) for 0 in range(n-1) ]
m = min(list)
a = 0
while True:
    m = m / 2
    if m <= 1:
        break
    a = a + 1
print(a)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = list(map(int, input().split()))
a = input().split()
b = 0
c = 0
while True:
    b = min(a) / 2
    if b <= 1:
        break
    c = c + 1
print(c)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input().split()
b = 0
c = 0
while True:
    b = min(a) / 2
    if b <= 1:
        break
    c = c + 1
print()

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input().split()
b = 0
c = 0
while True:
    b = min(a) / 2
    if b <= 1:
        break
    c = c + 1
print()

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
x = 0
for i in range(n) :
  list[] = int(input())

while True :
    for j in range(n):
        if list[j] % 2 == 1:
            break
    
    for k in range(n):
        list[k] = list[k] / 2

    x = x + 1
   
print(x)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
x = 0
for i in range(n) :
  list[] = int(input())

while True :
    for j in range(n):
        if list[j] % 2 == 1:
            break
    
    for k in range(n):
        list[k] = list[k] / 2

    x = x + 1
   
print(x)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
s = 0

def count(A, n):
    for i in range(n):
        if (A[i] % 2 == 1) or (A[i] == 0):
            return False
        A[i] = A[i] // 2
    return True

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)