Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
 
def linput(ty=int, cvt=list):
	return cvt(map(ty,input().split()))
 
def gcd(a: int, b: int):
	while b: a, b = b, a%b
	return a
 
def lcm(a: int, b: int):
	return a * b // gcd(a, b)
 
def main():
	#n=int(input())

Fixed submission:
import sys
input = sys.stdin.readline
 
def linput(ty=int, cvt=list):
	return cvt(map(ty,input().split()))
 
def gcd(a: int, b: int):
	while b: a, b = b, a%b
	return a
 
def lcm(a: int, b: int):
	return a * b // gcd(a, b)
 
def main():
	#n=int(input())
	#vA=linput()
	a,b,c = linput()
	
	res = 0
	
	x = (a%2)*b*c
	y = (b%2)*c*a
	z = (c%2)*a*b
	
	res = min(x,y,z)
	
	#sT = "No Yes".split()
	#print(sT[res])
	print(res)
 
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

A_dash = []
for i, A_i in enumerate(A):
    A_dash.append(A_i - (i))
A_dash.sort()

tmp_ans = sum(A_dash)
ans = 0
left, right = min(A_dash), max(A_dash)
mid = (left+right)//2
ans_left, ans_mid, ans_right = 0, 0, 0
for A_dash_i in A_dash:
    ans_left += abs(A_dash_i - (mid-1))
    ans_mid += abs(A_dash_i - (mid))
    ans_right += abs(A_dash_i - (mid+1))

while not (ans_left >= ans_mid and ans_mid <= ans_right):
    mid = (left+right)//2
    ans_left, ans_mid, ans_right = 0, 0, 0
    for A_dash_i in A_dash:
        ans_left += abs(A_dash_i - (mid-1))
        ans_mid += abs(A_dash_i - (mid))
        ans_right += abs(A_dash_i - (mid+1))
    if ans_left < ans_mid:
        right = (left+right)//2
    else:
        left = (left+right)//2

print(ans_mid)


Fixed submission:
N = int(input())
A = list(map(int, input().split()))
A_dash = []
for i, A_i in enumerate(A):
    A_dash.append(A_i-(i+1))
A_dash.sort()

med = A_dash[N//2]

ans = 0
for i, A_i in enumerate(A_dash):
    ans += abs(A_i - (med))

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import math

N = int(input())
A = list(map(int, input().split()))

def solve():
    ans = 0
    sums = [0]
    sum_val = 0
    for i, A_i in enumerate(A):
        sum_val += A_i
        sums.append(sum_val)
    for i in set(sums):
        cnt = sums.count(i)
        if cnt == 1:
            ans += 0
        else:
            ans += (cnt)*(cnt-1)//2
    print(ans)


if __name__ == '__main__':
    solve()

Fixed submission:
import collections

N = int(input())
A = list(map(int, input().split()))

def solve():
    ans = 0
    sums = [0]
    sum_val = 0
    for i, A_i in enumerate(A):
        sum_val += A_i
        sums.append(sum_val)
    c = collections.Counter(sums)
    for v in c.values():
        ans += (v)*(v-1)//2
    print(ans)


if __name__ == '__main__':
    solve()
Buggy python submission (verdict: Time Limit Exceeded):
from math import factorial

n = int(input())
a = list(map(int, input().split()))
a.sort()
max_a = max(a)
a.pop()
ans = -1
comb = 0
for a_i in a:
    if a_i >= max_a//2:
        comb = max(comb, (factorial(max_a) // factorial(max_a - a_i) * factorial(a_i)))
        ans = a_i
        break

for a_i in a[::-1]:
    if a_i <= max_a//2:
        if comb < factorial(max_a) // factorial(max_a - a_i) * factorial(a_i):
            ans = a_i
        break
print(max_a, ans)

        


Fixed submission:
from math import factorial

n = int(input())
a = list(map(int, input().split()))
max_a = max(a)
a.remove(max_a)
dis = float('inf')
ans = 0
for a_i in a:
    if abs(a_i - max_a//2) < dis:
        ans = a_i
        dis = abs(a_i - max_a//2)

print(max_a, ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
odd_cand = 1
ans = 1
for i in A:
    if i%2==0:
        odd_cand *= 2
    ans *= 3
 
print(ans - odd_cand)

Fixed submission:
S = input()
if "AC" in S:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# Here your code !
n = int(input())
pool = []
for i in range(n):
    a = input()
    if a not in pool:
        pool.append(a)
    else:
        pool.remove(a)
print(len(pool))

Fixed submission:
# coding: utf-8
# Here your code !
n = int(input())
pool = {}
for i in range(n):
    a = int(input())
    if a not in pool:
        pool[a] = True
    else:
       del pool[a]
print(len(pool))

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# Here your code !
n = int(input())
pool = []
for i in range(n):
    a = input()
    if a not in pool:
        pool.append(a)
    elif a in pool:
        pool.remove(a)
print(len(pool))


Fixed submission:
# coding: utf-8
# Here your code !
n = int(input())
pool = {}
for i in range(n):
    a = int(input())
    if a not in pool:
        pool[a] = True
    else:
       del pool[a]
print(len(pool))
Buggy python submission (verdict: Runtime Error):
def solve():
    A, B, C, D = list(map(int, input().split()))
    ans = min(B,D) - max(A,C)
    if ans < 0:
        ans = 0
    print(ans)
    
solve()

Fixed submission:
N = input()

if N[0] == N[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
N = int(input())
A = int(input())

print(N*N-A)

Fixed submission:
N = input()

if N[0] == N[2]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import fraction

N = int(input())
T = [int(input()) for i in range(N)]
_lcm = 1
for T_i in T:
    _lcm = _lcm * T_i // fraction.gcd(_lcm, T_i)

print(_lcm)

Fixed submission:
from fractions import gcd

N = int(input())
T = [int(input()) for i in range(N)]
_lcm = 1
for T_i in T:
    _lcm = _lcm * T_i // gcd(_lcm, T_i)

print(_lcm)

Buggy python submission (verdict: Runtime Error):
import math

N = int(input())
T = [int(input()) for i in range(N)]
_lcm = 1
for T_i in T:
    _lcm = _lcm * T_i // math.gcd(_lcm, T_i)

print(_lcm)

Fixed submission:
from fractions import gcd

N = int(input())
T = [int(input()) for i in range(N)]
_lcm = 1
for T_i in T:
    _lcm = _lcm * T_i // gcd(_lcm, T_i)

print(_lcm)
Buggy python submission (verdict: Time Limit Exceeded):
import sys

n, m = list(map(int, input().split()))
a_list1 = []
b_list1 = []
a_list2 = []
b_list2 = []

for i in range(m):
    a, b = list(map(int, input().split()))
    if a == 1:
        a_list1.append(a)
        b_list1.append(b)
    elif b == n:
        a_list2.append(a)
        b_list2.append(b)

for i in range(len(a_list1)):
    for j in range(len(a_list2)):
        if b_list1[i] == a_list2[j]:
            print('POSSIBLE')
            sys.exit()

print('IMPOSSIBLE')


Fixed submission:
import sys

n, m = list(map(int, input().split()))
mid_set1 = set([])
mid_set2 = set([])

for i in range(m):
    a, b = list(map(int, input().split()))
    if a == 1:
        mid_set1.add(b)
    elif b == n:
        mid_set2.add(a)

if len(mid_set1&mid_set2) > 0:
    print('POSSIBLE')
    sys.exit()
print('IMPOSSIBLE')

Buggy python submission (verdict: Time Limit Exceeded):
import sys

n, m = list(map(int, input().split()))
a_list = []
b_list = []
for i in range(m):
    a, b = list(map(int, input().split()))
    a_list.append(a)
    b_list.append(b)
ab = zip(a_list,b_list)

cand_b = []
for a, b in ab:
    if a == 1:
        cand_b.append(b)

ab = zip(a_list,b_list)
for a, b in ab:
    if a in cand_b and b == n:
        print('POSSIBLE')
        sys.exit()

print('IMPOSSIBLE')


Fixed submission:
import sys

n, m = list(map(int, input().split()))
mid_set1 = set([])
mid_set2 = set([])

for i in range(m):
    a, b = list(map(int, input().split()))
    if a == 1:
        mid_set1.add(b)
    elif b == n:
        mid_set2.add(a)

if len(mid_set1&mid_set2) > 0:
    print('POSSIBLE')
    sys.exit()
print('IMPOSSIBLE')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
an = list(input().split())
b = []

cnt = 1
for i in an:
    if cnt % 2 == 0 :
        b.insert(0, i)
    else:
        b.append(i)
    cnt += 1

if n % 2 == 1:
    b.reverse()

print(' '.join(b))


Fixed submission:
n = int(input())
a = list(input().split())
if n == 1:
    print(a[0])
elif n % 2:
    print(*(a[-1::-2] + a[1::2]))
else:
    print(*(a[-1::-2] + a[0::2]))

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

for i in an:
    b.append(i)
    b.reverse()

print(' '.join(map(str, b)))


Fixed submission:
n = int(input())
a = list(input().split())
if n == 1:
    print(a[0])
elif n % 2:
    print(*(a[-1::-2] + a[1::2]))
else:
    print(*(a[-1::-2] + a[0::2]))
Buggy python submission (verdict: Runtime Error):
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
cd = [list(map(int, input().split())) for i in range(N)]
for ab_i in ab:
    min_j = -1
    min_manh = float('inf')
    for j, cd_j in enumerate(cd):
        if min_manh > abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1]):
            min_manh = abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1])
            min_j = j+1
    print(min_j)

Fixed submission:
N, M = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
cd = [list(map(int, input().split())) for i in range(M)]
for ab_i in ab:
    min_j = -1
    min_manh = float('inf')
    for j, cd_j in enumerate(cd):
        if min_manh > abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1]):
            min_manh = abs(ab_i[0]-cd_j[0])+abs(ab_i[1]-cd_j[1])
            min_j = j+1
    print(min_j)
Buggy python submission (verdict: Time Limit Exceeded):
N = -1

def _input():
    global N
    N = int(input())

def solve():
    _input()
    snuke_power = 1
    for i in range(1, N+1):
        snuke_power *= i
    print(snuke_power % (10 ** 9 + 7))


if __name__ == '__main__':
    solve()

Fixed submission:
N = -1

def _input():
    global N
    N = int(input())

def solve():
    _input()
    snuke_power = 1
    for i in range(1, N+1):
        snuke_power *= i
        snuke_power %= (10 ** 9 + 7)
    print(snuke_power)


if __name__ == '__main__':
    solve()
Buggy python submission (verdict: Runtime Error):
S =int(input())
T=int(input())

print((S-1)*(T-1))

Fixed submission:
li=list(map(int, input().split()))
print((li[0]-1)*(li[1]-1))
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()

T_=slice(T[:-1])

if (S==T_):
    print("Yes")
elif:
    print("No")

Fixed submission:
S=input()
T=input()

T_=T[:-1]
if (S==T_):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A,B,C,K = map(int, input().split())

S = A+B+C
result = 0

if ( K > (A+B) ):
    result = A*(1) + (K-(A+B))*(-1)
else ( (A+B) >= K ):
    result = A*(1)

print(result)


Fixed submission:
A,B,C,K = map(int, input().split())

S = A+B+C
result = 0

if ( K > (A+B) ):
    result = A*(1) + (K-(A+B))*(-1)
elif ( (A+B) >= K >= A):
    result = A*(1)
elif ( A > K ):
    result = K*(1)

print(result)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] < sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')


Fixed submission:
X, Y, Z = map(int, input().split())

"""
temp = Y
Y = X
X = temp

temp = Z
Z = X
X = temp
"""

print(Z, X, Y)
Buggy python submission (verdict: Runtime Error):
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
     
    sum_A =0
    for i in range(N):
        sum_A += A[i]
     
    ans = 1
    for i in range(M):
        if (4*M*A[i] > sum_A):
            ans= ans*1
        else:
        	ans =ans*0
     
    if (ans == 1):
        print('Yes')
    else:
        print('No')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] >= sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

for i in range(N):
    if (4*M*A[M] < sum_A):
        print('No')
    else:
        print('Yes')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] >= sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]
 
if (4*M*A[M] < sum_A):
    print('No')
else:
    print('Yes')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] >= sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')

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

sum_A =0
for i in range(N):
    sum_A += A[i]

if (4*M*A[M] < sum_A):
    print('No')
else:
    print('Yes')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] >= sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [0 for i in range(N)]

sum_A =0
for i in range(N):
    sum_A += A[i]

if (4*M*A[M] < sum_A):
    print('No')
else:
    print('Yes')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
 
sum_A =0
for i in range(N):
    sum_A += A[i]

ans = 0
for i in range(N):
    if (4*M*A[i] >= sum_A):
        ans+=1
    else:
    	ans+=0
    	
if (ans >= M):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N,M = map(int, input().split())
el = {}
for i in range(N):
    P = list(map(int, input().split())).pop(0)
    if i == 0: el = set(P)
    el = el & set(P)
print(len(el))

Fixed submission:
N,M = map(int, input().split())
el = {}
for i in range(N):
    P = list(map(int, input().split()))
    K = P.pop(0)
    if i == 0: el = set(P)
    el = el & set(P)
print(len(el))
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce
N = int(input())
A = list(map(int, input().split()))
gcd = reduce(math.gcd, A)
print(gcd)

Fixed submission:
import fractions
from functools import reduce
N = int(input())
A = list(map(int, input().split()))
gcd = reduce(fractions.gcd, A)
print(gcd)

Buggy python submission (verdict: Runtime Error):
import sympy
N = int(input())
A = list(map(int, input().split()))

lcm = sympy.gcd(A)
print(lcm)

Fixed submission:
import fractions
from functools import reduce
N = int(input())
A = list(map(int, input().split()))
gcd = reduce(fractions.gcd, A)
print(gcd)
Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' print(ans)
  


Fixed submission:
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' 
print(ans)

Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split()) ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
ans = 'Yes' print(ans)
  


Fixed submission:
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' 
print(ans)

Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split()) ans = 'No'
for a in range(X + 1):
b=X-a
if 2 * a + 4 * b == Y:
ans = 'Yes' print(ans)
  


Fixed submission:
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' 
print(ans)

Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
a=[]
for n in range(0,a[0]+1):
    m=A[0]-n
    if 2*n+4*m=A[1]:
      a.append(1)
    
if 1 in a:
  print('yes')
else:
  print('No')
      
  


Fixed submission:
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' 
print(ans)

Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
a=[]
for n in range(0,101):
  for m in range(0,101):
    if n+m=A[0] & 2*n+4*m=A[1]:
      a.append(1)
    else:
      a.append(0)
      
if 1 in a:
  print('yes')
else:
  print('No')
      
  


Fixed submission:
X, Y = map(int, input().split()) 
ans = 'No'
for a in range(X + 1):
	b=X-a
	if 2 * a + 4 * b == Y:
		ans = 'Yes' 
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
print(700 + int(S.count() * 100))

Fixed submission:
S = input()
print(700 + S.count('o') * 100)

Buggy python submission (verdict: Runtime Error):
S = input()
print(700 + S.count() * 100)

Fixed submission:
S = input()
print(700 + S.count('o') * 100)
Buggy python submission (verdict: Runtime Error):
import pandas as pd
a, b = map(int, input().split() )
c = a * b
if c % 2 == 0:
  print('Even')
else:
  print('Odd')


Fixed submission:
a, b = map(int, input().split())
c = a * b
if c % 2 == 1:
  print('Odd')
else:
  print('Even')
Buggy python submission (verdict: Runtime Error):
s = input()
N = len(s)
print(s[0] + len(N - 2) + s[N - 1])

Fixed submission:
s = input()
N = len(s)
print(s[0] + str(N - 2) + s[N - 1])
Buggy python submission (verdict: Time Limit Exceeded):
N = input()
N = int(N)
A = input().split()

Y = 1
for i in range(N):
    X = A[i]
    X = int(X)
    Y = Y * X

M = 10 ** 18

if Y > M:
    print(-1)
else:
    print(Y)

Fixed submission:
N = input()
N = int(N)
A = input().split()

minA = min(A)
minA = int(minA)
M = 10 ** 18

Y = 0
if minA != 0:
    Y = 1
    for i in range(N):
        X = A[i]
        X = int(X)
        Y = Y * X
        if Y > M:
            break


if Y > M:
    print(-1)
else:
    print(Y)
Buggy python submission (verdict: Runtime Error):
if S == "ABC":
    print("ARC")
else:
    print("ABC")

Fixed submission:
S = input()

if S == "ABC":
    print("ARC")
else:
    print("ABC")

Buggy python submission (verdict: Runtime Error):
if S == "ABC":
    print("ARC")
else S == "ARC":
    print("ABC")

Fixed submission:
S = input()

if S == "ABC":
    print("ARC")
else:
    print("ABC")

Buggy python submission (verdict: Runtime Error):
#OutPut
if S == "ABC":
    print("ARC")
else S == "ARC":
    print("ABC")

Fixed submission:
S = input()

if S == "ABC":
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
x = sorted([int(i) for i in raw_input().split(" ")],reverse=True)
print(sum(x[::2]) - sum(x[1::2]))

Fixed submission:
n = int(input())
x = sorted([int(i) for i in input().split(" ")],reverse=True)
print(sum(x[::2]) - sum(x[1::2]))
Buggy python submission (verdict: Runtime Error):
x = list(map(int, input().split))
for i in x:
    if i == 0:
        print(i)

Fixed submission:
x = list(map(int, input().split()))
if x[0] == 0:
    print(1)
elif x[1] == 0:
    print(2)
elif x[2] == 0:
    print(3)
elif x[3] == 0:
    print(4)
else:
    print(5)
Buggy python submission (verdict: Time Limit Exceeded):
N , K = map(int, input().split())
p = list(map(int, input().split()))
Etop = 0
E = 0
q = []
for j in p:
    q.append((j+1) / 2)

for i in range(N-K+1):
    E = 0
    for n in range(K):
        E += q[n+i]
    if E > Etop:
        Etop = E
print(Etop)

Fixed submission:
N , K = map(int, input().split())
p = list(map(int, input().split()))
Etop = 0
E = 0
q = []
Ruiseki = 0
S = []
Top = 0
for i in p:
    q.append((i+1) / 2)

for E in q:
    Ruiseki += E
    S.append(Ruiseki)

if N == K:
    print(S[N-1])
    quit()
else:
    for j in range(N-K):
        Sig = S[K+j] - S[j]
        if Sig > Top:
            Top = Sig

print(Top)
Buggy python submission (verdict: Time Limit Exceeded):
x, n = map(int,input().split())
lst = set(map(int,input().split()))
df = 0
while True:
    if not (x + df) in lst: print(x + df)
    df = -df
    if not (x + df) in lst: print(x + df)
    df = -df
    df += 1

Fixed submission:
x, n = map(int,input().split())
lst = set(map(int,input().split()))
df = 0
while True:
    if not (x + df) in lst:
        print(x + df)
        exit()
    df = -df
    if not (x + df) in lst:
        print(x + df)
        exit()
    df = -df
    df -= 1
Buggy python submission (verdict: Runtime Error):
X, Y = map(int, input().split())
ans = 'No'
for a in range(X + 1):
	b = X - a
	if 2 * a + 4 * b == Y:
		ans = 'Yes'
7 print(ans)

Fixed submission:
X, Y = map(int, input().split())
ans = 'No'
for a in range(X + 1):
	b = X - a
	if 2 * a + 4 * b == Y:
		ans = 'Yes'
print(ans)
Buggy python submission (verdict: Runtime Error):
arr = [int(x) for x in input()]
c=1
for i in arr:
 if i==0:
  print(c)
 else:
  c+=1

Fixed submission:
arr = list(map(int,input().split()))

if arr[0]==0:
  print(1)
elif arr[1]==0:
  print(2)
elif arr[2]==0:
  print(3)
elif arr[3]==0:
  print(4)
else:
  print(5)

Buggy python submission (verdict: Runtime Error):
arr = list(map(int,input().split()))

for i,j in enumerate(len(arr)):
    if j==0:
        print(i)



Fixed submission:
arr = list(map(int,input().split()))

if arr[0]==0:
  print(1)
elif arr[1]==0:
  print(2)
elif arr[2]==0:
  print(3)
elif arr[3]==0:
  print(4)
else:
  print(5)
Buggy python submission (verdict: Runtime Error):
x,n = list(map(int,input().split()))
p= list(map(int,input().split()))
 
for i in range(x+1):
 for s in [-1,+1]:
   a=x+s*d
   if a not in p:
     print(a)

Fixed submission:
x,n = list(map(int,input().split()))
p= list(map(int,input().split()))
 
for i in range(x+1):
 for s in [-1,+1]:
   a=x+s*i
   if a not in p:
     print(a)
     exit(0)

Buggy python submission (verdict: Runtime Error):
x,n = list(map(int,input().split()))
p= list(map(int,input().split()))

for i in range(x+1):
 for s in [-1,+1]:
   a=X+s*d
   if a not in p:
     print(a)




Fixed submission:
x,n = list(map(int,input().split()))
p= list(map(int,input().split()))
 
for i in range(x+1):
 for s in [-1,+1]:
   a=x+s*i
   if a not in p:
     print(a)
     exit(0)
Buggy python submission (verdict: Runtime Error):
A,B,C,X = [int(input() for i in range(4))]
count = 0

for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      x = 500*a + 100*b + 50*c
      if X == x:
        count += 1
 
print(count)

Fixed submission:
A,B,C,X = [int(input()) for i in range(4)]
count = 0

for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      x = 500*a + 100*b + 50*c
      if X == x:
        count += 1
 
print(count)

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = input()
X = input()
count = 0

for a in range(0,A):
  for b in range(0,B):
    for c in range(0,C):
      x = 500*a + 200*b + 50*c
      if X == x:
        count += 1
print(count)
        

Fixed submission:
A,B,C,X = [int(input()) for i in range(4)]
count = 0

for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      x = 500*a + 100*b + 50*c
      if X == x:
        count += 1
 
print(count)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a%2==0 or b%2==0):
  print("Even")
else :
  print("Odd)

Fixed submission:
a,b = map(int, input().split())
if (a%2==0 or b%2==0):
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
N = int(input())
d = list(map(int, input().split()))

ans = 1
e = sorted(d,reverse = True)
for i in range(0,N):
	if i != 0:
		if e[i]<e[i-1]:
			ans += 1

print(ans)

Fixed submission:
N = int(input())
e = set()
for i in range(N):
  e.add(int(input()))

print(len(e))