Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

import sys

a, b = [int(e) for e in raw_input().split()]

ans = 'Even'
if (a & 1) and (b & 1):
    ans = 'Odd'
    
sys.stdout.write('%s\n' % (ans))
sys.stdout.flush()


Fixed submission:
# -*- coding: utf-8 -*-

import sys

n, a, b = [int(e) for e in raw_input().split()]
# print n, a, b
# print n*a, b
# print min(n*a, b)

sys.stdout.write('%d\n' % ( min(n*a, b) ))
sys.stdout.flush()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

import sys

n = int(raw_input().split()[0])
tl = []
for i in range(n):
    e = [int(e) for e in raw_input().split()]
    tl.append(e)
#print tl

t = 0
x = 0
y = 0
ans = 'Yes'
for i in tl:
    ti, xi, yi = i
    dt = ti - t
    dx = abs(xi - x)
    dy = abs(yi - y)
    # print [t,x,y], i, [dt,dx,dy],
    if (dx + dy) > dt:
        # print '!',
        ans = 'No'
        break
    if (dt - (dx + dy)) & 1:
        # print '!!',
        ans = 'No'
        break
    # print
    t = ti
    x = xi
    y = yi
    
# print
sys.stdout.write('%s\n' % (ans))
sys.stdout.flush()


Fixed submission:
# -*- coding: utf-8 -*-

import sys

u"""
1023回全て check
"""

def ones(n):
    o = 0
    for i in xrange(0, 10):
        b = 1 << i
        if n & b:
            o += 1
    return o

n = int(raw_input().split()[0])
# print n

openL = []
for _ in xrange(0, n):
    fs = ''.join( [e for e in raw_input().split()] )
    openL.append( int(fs, base=2) )
    
profL = []
for _ in xrange(0, n):
    profL.append( [int(e) for e in raw_input().split()] )

# print n
# print [hex(e) for e in openL]
# print profL, len(profL[0])

# print ones(0), ones(0x3ff)

maxP = -sys.maxint - 1
for i in xrange(1, 1024):
    p = 0
    for x in xrange(0, len(openL)):
        ox = openL[x]
        px = profL[x]
        p += px[ ones(ox & i) ]

    if p > maxP:
        maxP = p
    
sys.stdout.write('%d\n' % maxP)
sys.stdout.flush()
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, raw_input().split())
if A * B < C:
  print(A*B)
else:
  print(C)
  

Fixed submission:
A, B, C = map(int, input().split())
if A * B < C:
    print(A * B)
else:
    print(C)
Buggy python submission (verdict: Runtime Error):
R = int(input(())
B = int(input())
print(2 * B - R)

Fixed submission:
R = int(input())
B = int(input())
print(2 * B - R)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
nums = []
for i in range(N):
    A = int(input())
    if A in nums:
        nums.remove(A)
    else:
        nums.append(A)

print(len(nums))


Fixed submission:
N = int(input())
nums = {}
for i in range(N):
    A = int(input())
    nums.setdefault(A, 0)
    nums[A] += 1

result = 0
for k, v in nums.items():
    if v % 2 != 0:
        result += 1

print(result)
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
result = a+b if a+b < 10 else ‘Error’ 
print(result)

Fixed submission:
A, B = map(int, input().split())
if A + B < 10:
  print(A+B)
else:
  print("error")
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
connected = {}

for i in range(M):
    a, b = map(int, input().split())
    connected.setdefault(a, 0)
    connected.setdefault(b, 0)
    connected[a] += 1
    connected[b] += 1

for i in range(1, N + 1):
    print(connected[i])


Fixed submission:
N, M = map(int, input().split())
G = [[0 for i in range(N)] for i in range(N)]
for i in range(M):
    a, b = map(int, input().split())
    G[a - 1][b - 1] += 1
    G[b - 1][a - 1] += 1
for i in range(N):
    s = 0
    for j in range(N):
        s += G[i][j]
    print(s)
Buggy python submission (verdict: Runtime Error):
N = int(input())
G1 = [int(i) for i in input().split()] 
G2 = [int(i) for i in input().split()] 
one = [0 for i in range(N)]
two = [0 for i in range(N)]
i = j = 0

for i in range(N):
    for j in range(0,i+1):
        one[i] = one[i] + G1[j]
    for k in range(i,N):
        two[i] = two[i] + G2[k]

sum = 0
for i in range(N):
    if sum < one[i] + two[N-1]:
        sum = one[i] + two[N-1]

print(sum)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())
N = (X-A) % B
print(N)

Buggy python submission (verdict: Runtime Error):
X, A, B = list(map(int, input().split()))
X= (X-A)%B
print(X)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())
N = (X-A) % B
print(N)

Buggy python submission (verdict: Runtime Error):
X, A, B = list(map(int, input().split()))
N1 = X-A
N2 = N1/B
N3 = N1-N2*B

Fixed submission:
X = int(input())
A = int(input())
B = int(input())
N = (X-A) % B
print(N)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

A = int(input())
B = int(input())
C = int(input())
X = int(input())
ans = 0
for i in range(A + 1):
    for j in range(B + 1):
        for k in range(C + 1):
            if 500*i + 100*j + 50*k == X:
                ans += 1
print(ans)

Fixed submission:
#-*- coding: utf-8 -*-
a = int(input())
b = int(input())
c = int(input())
print((a-b)%c)

Buggy python submission (verdict: Runtime Error):
#-*- coding: utf-8 -*-
A = int(input())
B = int(input())
C = int(input())
X = int(input())
ans = 0
for i in range(A + 1):
    for j in range(B + 1):
        for k in range(C + 1):
            if 500*i + 100*j + 50*k == X:
                ans += 1
print(ans)

Fixed submission:
#-*- coding: utf-8 -*-
a = int(input())
b = int(input())
c = int(input())
print((a-b)%c)
Buggy python submission (verdict: Runtime Error):
#-*- coding: utf-8 -*- 
a,b = map(int, input().split())
p = a*b
if p%2 == 0:
   print("Even")
else:
   print(Odd)
 

Fixed submission:
#-*- coding: utf-8 -*- 
a,b = map(int, input().split())
p = a*b
if p%2 == 0:
   print("Even")
else:
   print("Odd")
Buggy python submission (verdict: Runtime Error):
#-*- coding: utf-8 -*- 
import numpy as np
a,b = map(str, input().split())
p = int(a+b)
 
if p == int(np.sqrt(p))**2 :
   print("Yes")
else:
   print(No)
 

Fixed submission:
#-*- coding: utf-8 -*- 
import numpy as np
a,b = map(str, input().split())
p = int(a+b)
 
if p == int(np.sqrt(p))**2 :
   print("Yes")
else:
   print("No")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input())
if a*b%2 = 0:
    print(Even)

else:
    print(Odd)

Fixed submission:
a,b = map(int,input().split())
if (a*b)%2 == 0:
    print("Even")

else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
a,b,c =map(int,input().split())
s = a+b+c
print(s)

Fixed submission:
s = int(input())
a=int(s/100)
s-=100*a
b=int(s/10)
s-=10*b

print(a+b+s)
Buggy python submission (verdict: Runtime Error):
R,G = map(int,input().split())
print(2*G-R)

Fixed submission:
R = int(input())
G = int(input())
print(2*G-R)

Buggy python submission (verdict: Runtime Error):
R,G = map(int,input().split())
print(str(2*G-R))

Fixed submission:
R = int(input())
G = int(input())
print(2*G-R)

Buggy python submission (verdict: Runtime Error):
R,G = map(int,input().split())
print(int(2*G-R))

Fixed submission:
R = int(input())
G = int(input())
print(2*G-R)

Buggy python submission (verdict: Runtime Error):
R,G = map(int,input().split())
print(2*G-R)

Fixed submission:
R = int(input())
G = int(input())
print(2*G-R)
Buggy python submission (verdict: Runtime Error):
x=input()
a=input()
b=input()

c=x-a
print(c%b)

Fixed submission:
x=int(input())
a=int(input())
b=int(input())

c=x-a
print(c%b)
Buggy python submission (verdict: Runtime Error):
def gyaku(x):
    y = []
    for i in range(len(x)):
        y.append(x.pop())
    return y

n = input()
a = map(int, raw_input().split())
b = []
for i in range(n):
    b.append(a[i])
    b = gyaku(b)
print(' '.join(map(str, b)))

Fixed submission:
p = map(int, raw_input().split())
print sum(p)-max(p)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

partA = list(map(int, input().split()))
partB = list(map(int, input().split()))
partC = list(map(int, input().split()))
counter = 0

for i in range(N):
     for f in range(N):
         if partA[i] < partB[f]:
                for s in range(N):
                    if partB[f] < partC[s]:
                        counter += 1
print(counter)

Fixed submission:
import bisect

def find_lt(a, x):
    i = bisect.bisect_left(a, x)
    if i:
        return i
    return 0

def find_l(a, x):
    i = bisect.bisect_right(a, x)
    if i == 0:
        return len(a)
    else:
        return len(a) - i

def main():
    N = int(input())

    partA = list(map(int, input().split()))
    partA.sort()
    partB = list(map(int, input().split()))
    partB.sort()
    partC = list(map(int, input().split()))
    partC.sort()
    cnt = 0


    for b in partB:
        A = find_lt(partA, b)
        #print (A)
        B = find_l(partC, b)
        #print (B)
        cnt += (A * B)

    print(cnt)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = [int(input()) for i in range(N)]

a.sort()
ans = sum(a)
for i in range(len(a)):
    if ans % 10 == 0:
        ans = ans - a[i]
print (ans)


Fixed submission:
l = list(map(int,input().split()))
if l[0] + l[1] < 10:
    print(l[0] + l[1])
else:
    print('error')
Buggy python submission (verdict: Runtime Error):
 = int(input())

print(N * 800 - ((N // 15) * 200))

Fixed submission:
N = int(input())

print(N * 800 - ((N // 15) * 200))

Buggy python submission (verdict: Runtime Error):
N = input()

print(N / 15)

print(N * 800 - ((N / 15) * 200))


Fixed submission:
N = int(input())

print(N * 800 - ((N // 15) * 200))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import math
H, W = (int(x) for x in input().split())

convert = [[int(x) for x in input().split()] for _ in range(10)]
table = [[int(x) for x in input().split()] for _ in range(H)]

conv_to_one = [0] * 10
for i in [x for x in range(10) if (x != 1)]:
    distance = [math.inf for _ in range(10)]
    distance[i] = 0
    not_reached = list(range(10))
    
    while (1 in not_reached):
        min_distance = math.inf
        new_reached = None
        for num in not_reached:
            if (distance[num] < min_distance):
                min_distance = distance[num]
                new_reached = num
        not_reached.remove(new_reached)

        for num in not_reached:
            if min_distance + convert[new_reached][num] < distance[num]:
                distance[num] = min_distance + convert[new_reached][num]
    conv_to_one[i] = distance[1]

count = [0] * 10
for row in table:
    for elem in row:
        if elem != -1:
            count[elem] += 1


result = sum([cnt * cnv for cnt,cnv in zip(count, conv_to_one)])
print(result)

Fixed submission:
    # coding: utf-8
H, W = (int(x) for x in input().split())
 
convert = [[int(x) for x in input().split()] for _ in range(10)]
table = [[int(x) for x in input().split()] for _ in range(H)]
 
conv_to_one = [0] * 10
for i in [x for x in range(10) if (x != 1)]:
    distance = [float("inf") for _ in range(10)]
    distance[i] = 0
    not_reached = list(range(10))
    
    while (1 in not_reached):
        min_distance = float("inf")
        new_reached = None
        for num in not_reached:
            if (distance[num] < min_distance):
                min_distance = distance[num]
                new_reached = num
        not_reached.remove(new_reached)
 
        for num in not_reached:
            if min_distance + convert[new_reached][num] < distance[num]:
                distance[num] = min_distance + convert[new_reached][num]
    conv_to_one[i] = distance[1]
 
count = [0] * 10
for row in table:
    for elem in row:
        if elem != -1:
            count[elem] += 1
 
 
result = sum([cnt * cnv for cnt,cnv in zip(count, conv_to_one)])
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
import math
N = int(input())
a_list = [int(x) for x in input().split()]
b_list = [int(x) for x in input().split()]
c_list = [int(x) for x in input().split()]
a_list.sort()
b_list.sort()
c_list.sort()

a_lt_b_index = [N] * N
i = j = 0
while (i < N and j < N):
    if (a_list[i] < b_list[j]):
        a_lt_b_index[i] = j
        i += 1
    else:
        j += 1

b_lt_c_count = [0] * (N+1)
i = j = 0
while (i < N and j < N):
    if (b_list[i] < c_list[j]):
        b_lt_c_count[i] = N-j
        i += 1
    else:
        j += 1

sum_of_b_lt_c = [sum(b_lt_c_count[i:]) for i in range(N+1)]

print(sum([sum_of_b_lt_c[a_lt_b_index[i]] for i in range(N)]))


Fixed submission:
N = int(input())
A_list = [int(a) for a in input().split()]
B_list = [int(b) for b in input().split()]
C_list = [int(c) for c in input().split()]
A_list.sort()
B_list.sort()
C_list.sort()

i = j = N-1
count_B_gt_A = [0] * N
while i >= 0 and j >= 0:
    if B_list[i] > A_list[j]:
        count_B_gt_A[i] = j+1
        i -= 1
    else:
        j -= 1

i = j = 0
count_B_lt_C = [0] * N
while i < N and j < N:
    if B_list[i] < C_list[j]:
        count_B_lt_C[i] = N - j
        i += 1
    else:
        j += 1
    
result = sum([B_gt_A * B_lt_C for B_gt_A, B_lt_C in zip(count_B_gt_A, count_B_lt_C)])
print(result)
Buggy python submission (verdict: Runtime Error):
input()
S = input()
x = 0
max_x = 0
for elem in S:
	if elem == 'I':
		x += 1
	elif elem == 'D':
		x -= 1
	if x > max_x:
		max_x = x
print(max_x)

Fixed submission:
A, B, C, D = map(int, input().split())
S1 = A * B
S2 = C * D
if S1 > S2:
    print(S1)
else:
    print(S2)
Buggy python submission (verdict: Runtime Error):
    input()
    S = input()
    x = 0
    max_x = 0
    for elem in S:
    	if elem == 'I':
    		x += 1
    	elif elem == 'D':
    		x -= 1
    	if x > max_x:
    		max_x = x
    print(max_x)

Fixed submission:
input()
S = input()
x = 0
max_x = 0
for elem in S:
    if elem == "I":
        x += 1
    elif elem == "D":
        x -= 1
    if x > max_x:
        max_x = x
print(max_x)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
a,b,x = tuple(map(int, input().split()))
print(b//x - (a-1)//x)

Fixed submission:
# -*- coding: utf-8 -*-
print("".join([w[0] for w in input().split()]))

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
a,b,x = map(int, input().split())
print(b//x - (a-1)//x)

Fixed submission:
# -*- coding: utf-8 -*-
print("".join([w[0] for w in input().split()]))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0

for i in list(set(a)):
    count_of_i = a.count(i)
    if count_of_i < i:
        ans += count_of_i
    else:
        ans += count_of_i - i
print(ans)


Fixed submission:
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
ans = 0
counter = Counter(a)
for i in set(a):
    if counter[i] < i:
        ans += counter[i]
    else:
        ans += counter[i] - i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in list(set(a)):
    count_of_i = a.count(i)
    if count_of_i < i:
        ans += count_of_i
    else:
        ans += count_of_i - i
print(ans)


Fixed submission:
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
ans = 0
counter = Counter(a)
for i in set(a):
    if counter[i] < i:
        ans += counter[i]
    else:
        ans += counter[i] - i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
lastcheck = -1
for i in a:
    if i == lastcheck:
        continue
    else:
        count_of_i = a.count(i)
        if count_of_i < i:
            ans += count_of_i
        else:
            ans += count_of_i - i
        lastcheck = i
print(ans)


Fixed submission:
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
ans = 0
counter = Counter(a)
for i in set(a):
    if counter[i] < i:
        ans += counter[i]
    else:
        ans += counter[i] - i
print(ans)
Buggy python submission (verdict: Runtime Error):
p = input()
if p % 10 == 9:
  print ("Yes")
else:
  print("No")


Fixed submission:
p = int(input())
if p % 10 == 9 or 90 <= p <= 99:
    print ("Yes")
else:
    print ("No")
Buggy python submission (verdict: Runtime Error):
N=int(input())
d=[input() for i in range(N)]
d_uni=list(set(d))
print(len(d_uni))

Fixed submission:
S=input()
S1='2018'+S[4:]
print(S1)
Buggy python submission (verdict: Runtime Error):
n,a,b=map(int,input().split())

ans=0
for i in range(n+1):
    l=[int(x) for x in list(str(i))]
    if a<=sum(l)<=b:
        ans=ans+i
print(ans)

Fixed submission:
a,b,c,d = map(int, input().split())
if a+b>c+d:
    print('Left')
elif a+b<c+d:
    print('Right')
else:
    print('Balanced')
Buggy python submission (verdict: Runtime Error):
r=int(input())
g=int(input())

print(2g-r)

Fixed submission:
r=int(input())
g=int(input())

print(2*g-r)

Buggy python submission (verdict: Runtime Error):
r=map(int,input())
g=map(int,input())

print(2g-r)


Fixed submission:
r=int(input())
g=int(input())

print(2*g-r)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp = temp[0]+temp[1]
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))

Fixed submission:
N,A,B = map(int,input().split())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp=sum(temp)
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp = temp[0]+temp[1]
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))

Fixed submission:
N,A,B = map(int,input().split())
ans_list = []

for i in range(0,N+1):
    if i < 10:
        if i >= A and i <=B:
            ans_list.append(i)
    else:
        temp = list(map(int,str(i)))
        temp=sum(temp)
        if temp >=A and temp<=B:
            ans_list.append(i)
            
print(sum(ans_list))
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int, input().split()))
c = 0
bool = True


while (bool):
    for i in range(N):
        if a[i] % 2 == 0:
            a[i] = a[i] / 2
        else:
            bool = False
            break    
    else:
        c += 1

Fixed submission:
a = input()
count = 0

for i in range(3):
    if a[i] == "1":
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
import sys
N = int(input())
a = list(map(int, input().split()))
c = 0

while True:
    for i in range(N):
        if a[i] % 2 == 0:
            a[i] = a[i] / 2
        else:
            print(c)
            sys.exit()
    c += 1
print(c)

Fixed submission:
a = input()
count = 0

for i in range(3):
    if a[i] == "1":
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input(),split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = map(int,input(),split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")


Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a % 2 == 0 or b % 2 == 0:
    print("Even")
else:
    print("Odd")


Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a % 2 == 0 or b % 2 == 0:
    print("even")
else:
    print("odd")


Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a % 2 == 0 or b % 2 == 0:
    print("even")
else
    print("odd")

Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a % 2 = 0 or b % 2 =0:
    print("even")
else:
    print("odd")


Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a%2 = 0 or b%2 =0:
    print("even")
else:
    print("odd")


Fixed submission:
a, b = map(int,input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a = int(input())

b = int(input())

seki = a * b

if seki % 2 == 0:
    print('Even')
else:
    print('Odd')

Fixed submission:
a, b = map(int, input().split())

seki = a * b

if seki % 2 == 0:
    print('Even')
else:
    print('Odd')
Buggy python submission (verdict: Runtime Error):
n = input().split()
a = list(map(int, input().split() ))
count = 0

while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0:
            T=True

        a[i] = a[i] / 2

    if T:
        break
    
    count+=1

print(count)


Fixed submission:

s = input()
a = [int(c) for c in s]

print(a[0] + a[1] + a[2])

Buggy python submission (verdict: Runtime Error):
n = input().split()
a = list(map(int, input().split()))
b = 0
c = []
count = 0


while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0 :
            T = True 
        
        if T:
            break


    for i in range(len(a)):
        b = a[i] / 2
        c.append(b)
        
    a = c
    count+=1


print(count)


Fixed submission:

s = input()
a = [int(c) for c in s]

print(a[0] + a[1] + a[2])
Buggy python submission (verdict: Time Limit Exceeded):
n = input().split()
a = list(map(int, input().split()))
b = 0
c = []
count = 0

while(True):
    T = False
    for i in range(len(a)):
        b = a[i] / 2
        c.append(b)
        if a[i]%2 != 0:
            T=True

    if T:
        break

    a = c
    count+=1


print(count)


Fixed submission:
n = input().split()
a = list(map(int, input().split() ))
count = 0

while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0:
            T=True
        else:
            a[i] = a[i] / 2

    if T:
        break

    count+=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = input().split()
a = list(map(int, input().split()))
b = 0
c = []
count = 0


while(True):
    T = False
    for i in range(len(a)):
        b = a[i] / 2
        c.append(b)
        if a[i]%2 != 0:
            T=True

    if T:
        break

    a = c
    count+=1


print(count)


Fixed submission:
n = input().split()
a = list(map(int, input().split() ))
count = 0

while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0:
            T=True
        else:
            a[i] = a[i] / 2

    if T:
        break

    count+=1

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = input().split()
a = list(map(int, input().split()))
b = 0
c = []
count = 0


while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0 :
            T = True 
            
    if T:
        break

    for i in range(len(a)):
        b = a[i] / 2
        c.append(b)
        
    a = c
    count+=1


print(count)


Fixed submission:
n = input().split()
a = list(map(int, input().split() ))
count = 0

while(True):
    T = False
    for i in range(len(a)):
        if a[i]%2 != 0:
            T=True
        else:
            a[i] = a[i] / 2

    if T:
        break

    count+=1

print(count)