Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
X,N = map(int,input().split())
if N == 0 :
    print(X)
else :
    P = list(map(int,input().split()))
    a = list(range(10000000))
    ab = 101
    an = []
    for i in range(-1.N):
        a.remove(P[i])
        a = a
    for j in range(101 - N):
        ab = min(ab,abs(X - a[j]))
    if X - ab in a :
        print(X - ab)
    elif X + ab in a:
        print(X + ab)
        
 

    

Fixed submission:
X,N = map(int,input().split())
if N == 0 :
    print(X)
else :
    P = list(map(int,input().split()))
    a = list(range(10000000))
    ab = 101
    an = []
    for i in range(N):
        a.remove(P[i])
        a = a
    for j in range(0,102):
        ab = min(ab,abs(X - a[j]))
    if X - ab in a :
        print(X - ab)
    elif X + ab in a:
        print(X + ab)
Buggy python submission (verdict: Runtime Error):
import functools
import operator

N = int(input())
A = list(map(int,input().split()))
result = functools.reduce(operator.mul, A)
if '0' in A :
    print(0)
else :
    if result > 10**18 :
        print('-1')
    else :
        print(result)

Fixed submission:
A,B = map(int,input().split())
print(A*B)

Buggy python submission (verdict: Runtime Error):
import functools
import operator

N = int(input())
A = list(map(int,input().split()))
result = functools.reduce(operator.mul, A)
if 0 in A :
    print(0)
else :
    if result > 10**18 :
        print('-1')
    else :
        print(result)


Fixed submission:
A,B = map(int,input().split())
print(A*B)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N[len(N)-1] == 2 or 4 or 5 or 7 or 9 :
    print('hon')
elif N[len(N)-1] == 0 or 1 or 6 or 8 :
    print('pon')
else :
    print('bon')

Fixed submission:
N = input()
n = int(N[len(N)-1] )
if n == 0 or n == 1 or n ==  6 or n == 8   :
    print('pon')
elif n == 2 or n == 4 or n == 5 or n == 7 or n == 9 :
    print('hon')
elif n == 3 :
    print('bon')

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
N = 100*a + 10*b + c
if c == 2 or 4 or 5 or 7 or 9 :
    print('hon')
elif c == 0 or 6 or 1 or 8 :
    print('pon')
else :
    print('bon')

Fixed submission:
N = input()
n = int(N[len(N)-1] )
if n == 0 or n == 1 or n ==  6 or n == 8   :
    print('pon')
elif n == 2 or n == 4 or n == 5 or n == 7 or n == 9 :
    print('hon')
elif n == 3 :
    print('bon')
Buggy python submission (verdict: Runtime Error):
import math 
A,B,H,M = map(int,input().split())
print(( A**2 + B **2 - 2**B**A**(math.cos(math.radians(abs(30*H-5.5*M)))))**0.5)


Fixed submission:
a, b, h, m = map(int, input().split())
aka = 360 * (h / 12) + 30 * (m / 60)
ao = 360 * (m / 60)
seta = aka - ao
import math
seta = math.radians(seta)
ans = a ** 2 + b ** 2 - 2 * a * b * math.cos(seta)
print(math.sqrt(ans))

Buggy python submission (verdict: Runtime Error):
import math 
A,B,H,M = map(int,input().split())
print(( A**2 + B **2 - 2**B**A**(math.cos(math.radians(abs(30*H-6*M)))))**0.5)

Fixed submission:
a, b, h, m = map(int, input().split())
aka = 360 * (h / 12) + 30 * (m / 60)
ao = 360 * (m / 60)
seta = aka - ao
import math
seta = math.radians(seta)
ans = a ** 2 + b ** 2 - 2 * a * b * math.cos(seta)
print(math.sqrt(ans))
Buggy python submission (verdict: Runtime Error):
S = input()
if S =  'ABC' :
    print( 'ARC' )
elif S =  'ARC' :
    print( 'ABC' )


Fixed submission:
S = input()
if S ==  'ABC' :
    print( 'ARC' )
elif S ==  'ARC' :
    print( 'ABC' )

Buggy python submission (verdict: Runtime Error):
S = input()
if S = ( 'ABC' ):
    print( 'ARC' )
elif S = ( 'ARC' ):
    print( 'ABC' )

Fixed submission:
S = input()
if S ==  'ABC' :
    print( 'ARC' )
elif S ==  'ARC' :
    print( 'ABC' )
Buggy python submission (verdict: Runtime Error):
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1)
    if i % K == 0:
        print('OK')
        quit()
else : 
    print('NG')


Fixed submission:
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i % K == 0:
        print( 'OK' )
        quit()
else:
    print( 'NG' )

Buggy python submission (verdict: Runtime Error):
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1)
    if i % K == 0:
        print('OK')
else : 
    print('NG')

Fixed submission:
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i % K == 0:
        print( 'OK' )
        quit()
else:
    print( 'NG' )

Buggy python submission (verdict: Runtime Error):
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i % K == 0:
        print( 'OK' )
        stop()
else:
    print( 'NG' )

Fixed submission:
K = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i % K == 0:
        print( 'OK' )
        quit()
else:
    print( 'NG' )
Buggy python submission (verdict: Runtime Error):
map = input( int() )
print( 2*3.14*R )

Fixed submission:
print(int(input())*6.3)
Buggy python submission (verdict: Runtime Error):
N,M = map( int, input().split() )
A = list( map(int, input().split() )
print(max(-1, N - sum(A)))

Fixed submission:
N,M = map( int, input().split() )
A = list( map(int, input().split() ))
print(max(-1, N - sum(A)))

Buggy python submission (verdict: Runtime Error):
N,M = map( int, input().split() )
A = list( map(int, input().split() )
print(max(-1, N - sum(A)))

Fixed submission:
N,M = map( int, input().split() )
A = list( map(int, input().split() ))
print(max(-1, N - sum(A)))

Buggy python submission (verdict: Runtime Error):
N,M = map( int,input().split())
A = list(map(int,input().split())
print(max(-1,N - sum(A)))

Fixed submission:
N,M = map( int, input().split() )
A = list( map(int, input().split() ))
print(max(-1, N - sum(A)))

Buggy python submission (verdict: Runtime Error):
N,M = map( int,input().split())
A = list(map(int,input().split())
print(max(-1),N - sum(A))

Fixed submission:
N,M = map( int, input().split() )
A = list( map(int, input().split() ))
print(max(-1, N - sum(A)))

Buggy python submission (verdict: Runtime Error):
N,M = map( int,input().split())
A = list(map(int,input().split())
print(N - sum(A))

Fixed submission:
N,M = map( int, input().split() )
A = list( map(int, input().split() ))
print(max(-1, N - sum(A)))
Buggy python submission (verdict: Runtime Error):
n = input()
for ni in n:
    if ni == '7'
        print( 'Yes' )
        quit()
print( 'No' )

Fixed submission:
n = input()
for ni in n:
    if ni == '7' :
        print( 'Yes' )
        quit()
print( 'No' )

Buggy python submission (verdict: Runtime Error):
N = int( input() )
if 7 in input :
    print( 'Yes' )
else :
    print( 'No' )

Fixed submission:
n = input()
for ni in n:
    if ni == '7' :
        print( 'Yes' )
        quit()
print( 'No' )
Buggy python submission (verdict: Runtime Error):
S = input()
if S[3] == S[4] and S[5] == S[6] :
    print( 'Yes' )
else :
    print( 'No' )

Fixed submission:
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print( 'Yes' )
else :
    print( 'No' )
Buggy python submission (verdict: Runtime Error):
N,M = map( int,input().split() )
print(int( N*(N-1)/2 + M*(M-1)/2)

Fixed submission:
N,M = map( int,input().split() )
print(int( N*(N-1)/2 + M*(M-1)/2))
Buggy python submission (verdict: Runtime Error):
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    prnt(math.ceil((H*M)/2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    prnt(round((H*M)/2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    prnt(int((H*M +1)//2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 and M ==1 :
    print(1)
else :
    prnt((H*M +1)//2)

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 and M ==1 :
    print(1)
else :
    prnt(int((H*M +1)//2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 and M ==1 :
    print(1)
else :
    prnt(int((H*M +1)/2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if H == 1 and M == 1:
    print(1)
else :
    print(round(H*M/2)

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if M%2 == 0 :
    print(int(H*M/2))
else :
    prnt(int(H*M/2) + round(H/2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))

Buggy python submission (verdict: Runtime Error):
H,M = map(int,input().split())
if M//2 == 0 :
    print(int(H*M/2))
else :
    prnt(int(H*M/2) + round(H/2))

Fixed submission:
import math
H,M = map(int,input().split())
if H == 1 or M ==1 :
    print(1)
else :
    print(math.ceil((H*M)/2))
Buggy python submission (verdict: Runtime Error):
N,R = map(int,input().split())
if N < 10 :
    print(R - 100*(10-K))
else :
    print(R)

Fixed submission:
N,R = map(int,input().split())
if N < 10 :
    print( R + 100*(10 - N) )
else :
    print( R )

Buggy python submission (verdict: Runtime Error):
N,R = map(int,input().split())
if N < 10 :
    print(100*(10-K))
else :
    print(K)

Fixed submission:
N,R = map(int,input().split())
if N < 10 :
    print( R + 100*(10 - N) )
else :
    print( R )

Buggy python submission (verdict: Runtime Error):
N,R = map(int, input().split() )
if N >= 10 :
    print( R ) 
else :
    print( R + 100*( 10 -N )
    

Fixed submission:
N,R = map(int,input().split())
if N < 10 :
    print( R + 100*(10 - N) )
else :
    print( R )
Buggy python submission (verdict: Runtime Error):
from decimal import Decimal
N = int(input())
M = N/Decimal(1.08)
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(:()

Fixed submission:
from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(':(')

Buggy python submission (verdict: Runtime Error):
import decimal 
N = int(input())
M = N/Decimal(1.08)
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(:()

Fixed submission:
from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(':(')

Buggy python submission (verdict: Runtime Error):
import decimal from Decimal 
N = int(input())
M = N/decimal(1.08)
if N == int(M*decimal(1.08)) :
    print( int(M))
else :
    print(:()

Fixed submission:
from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(':(')
Buggy python submission (verdict: Runtime Error):
S = input()
S1 = ''
S2 = ''
if i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min2 += 1 
print(min(min1,min2))


Fixed submission:
A,B = map(int,input().split())
if A > B :
    print( 2*A - 1 )
elif A == B :
    print( A + B )
else :
    print( 2*B - 1 )

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int,input().split()))
maxi = 0
cnt = 0
for i in range( N ) :
    if H[i] >= maxi :
        cnt += 1
        maxi = H[i]
print( cnt )
    


Fixed submission:
A,B = map(int,input().split())
if A > B :
    print( 2*A - 1 )
elif A == B :
    print( A + B )
else :
    print( 2*B - 1 )

Buggy python submission (verdict: Runtime Error):
A,B = list(int,input().split())
if A > B :
    print( 2*A - 1 )
else :
    print( 2*B - 1 )

Fixed submission:
A,B = map(int,input().split())
if A > B :
    print( 2*A - 1 )
elif A == B :
    print( A + B )
else :
    print( 2*B - 1 )
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int,input().split()))
maxi = 0
cnt = 0
for H[i] in range( N ) :
    if H[i] >= maxi :
        cnt += 1
        maxi = H[i]
print( cnt )
    


Fixed submission:
N = int(input())
H = list(map(int,input().split()))
maxi = 0
cnt = 0
for i in range( N ) :
    if H[i] >= maxi :
        cnt += 1
        maxi = H[i]
print( cnt )
Buggy python submission (verdict: Runtime Error):
S = input()
S1 = ''
S2 = ''
if i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S2[i]:
        min2 += 1 
print(min(min1,min2))


Fixed submission:
S = input()
S1 = ''
S2 = ''
for i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S2[i]:
        min2 += 1 
print(min(min1,min2))

Buggy python submission (verdict: Runtime Error):
S = input()
S1 = ''
S2 = ''
if i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min2 += 1 
print(min(min1,min2))


Fixed submission:
S = input()
S1 = ''
S2 = ''
for i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S2[i]:
        min2 += 1 
print(min(min1,min2))

Buggy python submission (verdict: Runtime Error):
S = list(input())
S1 = []
S2 = []
if i in range(len(S)):
    if i % 2 ==0 :
        S1.append('0')
        S2.append('1')
    else :
        S1.append('1')
        S2.append('0')
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min2 += 1 
print(min(min1,min2))


Fixed submission:
S = input()
S1 = ''
S2 = ''
for i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S2[i]:
        min2 += 1 
print(min(min1,min2))

Buggy python submission (verdict: Runtime Error):
S = list(input())
S1 = []
S2 = []
if i in range(len(S)):
    if i % 2 ==0 :
        S1.append('0')
        S2.append('0')
    else :
        S1.append('1')
        S2.append('2')
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min2 += 1 
print(min(min1,min2))

Fixed submission:
S = input()
S1 = ''
S2 = ''
for i in range(len(S)):
    if i % 2 ==0 :
        S1 += '0'
        S2 += '1'
    else :
        S1 += '1'
        S2 += '0'
min1 = 0
for i in range(len(S)):
    if S[i] != S1[i]:
        min1 += 1
min2 = 0
for i in range(len(S)):
    if S[i] != S2[i]:
        min2 += 1 
print(min(min1,min2))
Buggy python submission (verdict: Runtime Error):
b = input()
if b = A :
    print( 'T' )
elif b = T :
    print( 'A' )
elif b = G :
    print( 'C' )
elif b = C :
    print( 'G' )
        

Fixed submission:
b = input()
if b == 'A' :
    print( 'T' )
elif b == 'T' :
    print( 'A' )
elif b == 'G' :
    print( 'C' )
elif b == 'C' :
    print( 'G' )
Buggy python submission (verdict: Runtime Error):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,N) :
    A = list(int,input().split())
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if Sum > 0 :
        ans += 1
print(ans)

Fixed submission:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,N) :
    A = list(map(int,input().split()))
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if Sum > 0 :
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,n) :
    A = list(int,input().split())
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if Sum > 0 :
        ans += 1
print(ans)

Fixed submission:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,N) :
    A = list(map(int,input().split()))
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if Sum > 0 :
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,n) :
    A = list(int,input().split())
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if wa > 0 :
        ans += 1
print(ans)

Fixed submission:
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
ans = 0
for i in range(0,N) :
    A = list(map(int,input().split()))
    Sum = C
    for (x,y) in zip(A,B):
        Sum += (x*y)
    if Sum > 0 :
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
m = []
for i in N:
    m.append(int(input()))
print(len(m) + (X - sum(m))//min(m))


Fixed submission:
N,X = map(int,input().split())
m = []
for i in range(N):
    m.append(int(input()))
print(len(m) + (X - sum(m))//min(m))

Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
m = []
for i in N:
    d.append(int(input()))
print(len(m) + (X - sum(m))//min(d))

Fixed submission:
N,X = map(int,input().split())
m = []
for i in range(N):
    m.append(int(input()))
print(len(m) + (X - sum(m))//min(m))
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
a.sorted()
alice = 0
bob = 0
for i in range(N) :
    if i%2 == 0 : 
        alice += a[i]
    elif i%2 == 1 :
        bob += a[i]
print(alice-bob)
    


Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a.sort()
a.reverse()
alice = 0
bob = 0
for i in range(N) :
    if i%2 == 0 : 
        alice += a[i]
    elif i%2 == 1 :
        bob += a[i]
print(alice-bob)
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
Score = 0
for i in range(N+1):
    x = sum(list(map(int,str(i)))
    if A<= x <= B :
        cnt += i
print(cnt)

Fixed submission:
N,A,B = map(int,input().split())
Score = 0
for i in range(N+1):
    x = sum(list(map(int,str(i))))
    if A <= x <= B :
        Score += i
print(Score)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
ans = 0
while all( A%2 == 0 for A in a ):
        A = [ i/2 for i in a ]
        ans += 1
print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all( A%2 == 0 for A in a ):
	    A = [ i/2 for i in a ]
	    ans += 1
print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
ans = 0
while all( A%2 == 0 for A in a ):
        A = [ i/2 for i in a ]
        ans += 1
print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
ans = 0
while all( a%2 == 0 for a in A ):
        a = [ i/2 for i in A ]
        ans += 1
print(ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
ans = 0
while all( a%2 == 0 for a in A ):
    a = [ i/2 for i in A ]
    ans += 1
print(ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = 0
while all( a%2 == 0 for a in A ):
    a = [ i/2 for i in a ]
    ans += 1
print(ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = 0
while all( A%2 == 0 for a in A ):
    a = [ i/2 for i in a ]
    ans += 1
print(ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 0
while all(A%2 == 0 for A in a):
	a = [i/2 for i in a ]
	ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B,C = list(map(int,input().split()))
if A == B == C and A%2 == 0 :
    print(-1)
elif A == B == C and A%2 == 1 :
    print(0)
else :
    cnt=0
    while a%2==b%2==c%2==0:
        total=a+b+c
        a=total//2-a//2
        b=total//2-b//2
        c=total//2-c//2
        cnt+=1
    print(cnt)


Fixed submission:
A,B,C = list(map(int,input().split()))
if A == B == C and A%2 == 0 :
    print(-1)
elif A == B == C and A%2 == 1 :
    print(0)
else :
    cnt=0
    while A%2==B%2==C%2==0:
        total=A+B+C
        A=total//2-A//2
        B=total//2-B//2
        C=total//2-C//2
        cnt+=1
    print(cnt)
Buggy python submission (verdict: Runtime Error):
O = input()
E = input()
P = ''
for i in range(min(len(O)+1,len(E)+1)) :
    P = P + O[i]
    P = P + E[i]
print(P)

Fixed submission:
O = str(input())
E = str(input())
P = ''
for i in range(len(E)) :
    P = P + O[i]
    P = P + E[i]
if len(O) == len(E) :
    print(P)
else :
    print(P + O[-1])

Buggy python submission (verdict: Runtime Error):
O = str(input())
E = str(input())
P = ''
for i in range(len(O)+len(E)) :
    P = P + O[i]
    P = P + E[i]
print(P)
    

Fixed submission:
O = str(input())
E = str(input())
P = ''
for i in range(len(E)) :
    P = P + O[i]
    P = P + E[i]
if len(O) == len(E) :
    print(P)
else :
    print(P + O[-1])

Buggy python submission (verdict: Runtime Error):
O = input()
E = input()
P = ''
for i in range(len(O)+len(E)) :
    P = P + O[i]
    P = P + E[i]
print(P)
    

Fixed submission:
O = str(input())
E = str(input())
P = ''
for i in range(len(E)) :
    P = P + O[i]
    P = P + E[i]
if len(O) == len(E) :
    print(P)
else :
    print(P + O[-1])