Buggy python submission (verdict: Time Limit Exceeded):
input()
vals = map(int, input().split())
count = 0
is_odd = False
while True:
    for val in vals:
        if val % 2 == 1:
            is_odd = True
    if is_odd:
        break
    vals = map(lambda x: x/2, vals)
    count += 1
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = int(input())
vals = map(int, input().split())
result = 1000000
for i in range(0, N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)


Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = map(int, input().split())
result = 1000000
for i in range(0, N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = map(int, input().split())
result = 1000000
for i in range(N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)



Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = map(int, input().split())
result = 1000000
for i in xrange(N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)


Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
import sys
N = input()
vals = map(int, input().split())
result = sys.maxint
for i in xrange(N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Time Limit Exceeded):
input()
vals = map(int, input().split())
count = 0
start_val = sum(vals)
while True:
    if start_val % 2 == 1:
        break
    count += 1
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
vals = map(int, input().split())
count = 0
is_odd = False
while True:
    for val in vals:
        if val % 2 == 1:
            is_odd = True
    if is_odd:
        break
    vals = map(lambda x: x/2, vals)
    count += 1
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = map(int, input().split())
count = 0
is_odd = False
while True:
    for val in vals:
        if val % 2 == 1:
            is_odd = True
    if is_odd:
        break
    for i in xrange(N):
        vals[i] /= 2
    count += 1
print (count)


Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):

N = input()
vals = map(int, input().split())
count = 0
is_odd = False
while True:
    for val in vals:
        if val % 2 == 1:
            is_odd = True
    if is_odd:
        break
    for i in range(N):
        vals[i] /= 2
    count += 1
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Time Limit Exceeded):

N = input()
vals = map(int, input().split())
count = 0
is_odd = False
while True:
    for val in vals:
        if val % 2 == 1:
            is_odd = True
    if is_odd:
        break
    count += 1
    vals = map(lambda x: x/2, vals)
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = input().split()
count = 0
while True:
    for val in vals:
        if val % 2 == 1:
            break
    else:
        count += 1
        vals = map(lambda x: x/2, vals)
        continue
    break
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)

Buggy python submission (verdict: Runtime Error):
N = input()
vals = input().split()
count = 0
while True:
    for val in vals:
        if val % 2 == 1:
            break
    else:
        vals = map(lambda x: x/2, vals)
        continue
    break
print (count)

Fixed submission:
N = int(input())
vals = list(map(int, input().split()))
count = 0
is_odd = False
while True:
    for i in range(0, N):
        if vals[i] % 2 == 1:
            is_odd = True
        vals[i] /= 2
    if is_odd:
        break
    count += 1
print (count)