Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 1 + N - 2 #求めるのは(x-1) + (y-1)の最小値
for i in range(1, int(N**0.5)+1):
    if N%i==0:
        ans = min(ans, i+N//i-2)
print(ans)

Fixed submission:
A, B = map(int,input().split())
print(A*B if A<=9 and B<=9 else -1)

Buggy python submission (verdict: Runtime Error):
N,M,A,B=map(int,input().split())
for m in range(M):
    if N<=A:
        N+=B
    c=int(input())
    N-=c
    if N<0:
        print(m+1)
        break
else:
    print("complete")

Fixed submission:
A, B = map(int,input().split())
print(A*B if A<=9 and B<=9 else -1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
v = sorted(list(map(int, input().split())))
for i in range(N-1):
    a = (v[i]+v[i+1])/2
    v[i+1] = float(a)
    a = 0
print(v[-1])

Fixed submission:
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Buggy python submission (verdict: Runtime Error):
N = int(input())
v = sorted(list(map(int, input().split())))
for i in range(N):
    a = (v[i]+v[i+1])/2
    v[i+1] = int(a)
    v[i] = 'A'
    a = 0
print(v[-1])

Fixed submission:
a = int(input())
s = input()
print(s if a >= 3200 else 'red')
Buggy python submission (verdict: Runtime Error):
N = int(input())
v = sorted(list(map(int, input().split())))
for i in range(N-1):
    a = (v[i]+v[i+1])/2
    v[i] = 'A'
    v[i+1] = int(a)
    a = 0
print(a[-1])

Fixed submission:
N = int(input())
v = sorted(list(map(int, input().split())))
for i in range(N-1):
    a = (v[i]+v[i+1])/2
    v[i+1] = float(a)
    v[i] = 'A'
    a = 0
print(v[-1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
a = H[0]
for i in range(1,N-1):
    a = max(H[i], a)
    b = H[i+1]
    if a - b >= 2:
        print("No")
        break
print("Yes")

Fixed submission:
A, B, C = map(int, input().split())
print(C-(A-B) if C >= (A-B) else '0')
Buggy python submission (verdict: Runtime Error):
4
1 3 2 1

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
base = 0
for h in H:
    if base > h:
        print('No')
        break
    base = max(base,h-1)
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
W, H, x, y = map(int, input().split())
print(W*H/2, end=' ')
print(1 if W*y==x*H else 0)

Fixed submission:
X, A = map(int, input().split())
print(0 if X<A else 10)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
K = int(input())
for i in range(N):
    if S[i] != S[K+1]:
        S = S[:i] + '*' + S[(i+1):]
print(S)

Fixed submission:
N = int(input())
S = input()
K = int(input())
for i in range(N):
    if S[i] != S[K-1]:
        S = S[:i] + '*' + S[(i+1):]
print(S)

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
K = int(input())
for i in range(N):
    if S[i] != S[K]:
        S = S[:i] + '*' + S[(i+1):]
print(S)

Fixed submission:
N = int(input())
S = input()
K = int(input())
for i in range(N):
    if S[i] != S[K-1]:
        S = S[:i] + '*' + S[(i+1):]
print(S)
Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
list = []
for i in range(N):
    if S[i:i+2] == 'AC':
        list.append(i)
count = 0
for i in range(Q): #l,rをそれぞれ代入
    l, r = map(int, input().split())
    for k in list: 
        if l-1 <= k <= r-1 and l-1 <= k+1 <= r-1:
            count += 1
    print(count)
    count = 0

Fixed submission:
N, Q = map(int, input().split())
S = input()
count = [0]*N
for i in range(1, N): #i番目までに何個の'AC'があったかをリスト格納
    count[i] += count[i-1]
    if S[i-1:i+1] == 'AC':
        count[i] += 1
for i in range(Q):
    l, r = map(int, input().split())
    print(count[r-1]-count[l-1])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
for i in range(Q):
    l, r = map(int, input().split())
    print(S[l-1:r].count('AC'))

Fixed submission:
N, Q = map(int, input().split())
S = input()
count = [0]*N
for i in range(1, N): #i番目までに何個の'AC'があったかをリスト格納
    count[i] += count[i-1]
    if S[i-1:i+1] == 'AC':
        count[i] += 1
for i in range(Q):
    l, r = map(int, input().split())
    print(count[r-1]-count[l-1])

Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())
S = input()
lr = [list(map(int, input().split())) for i in range(Q)]
for i in range(Q):
    print(S[lr[i][0]-1:lr[i][1]].count('AC'))

Fixed submission:
N, Q = map(int, input().split())
S = input()
count = [0]*N
for i in range(1, N): #i番目までに何個の'AC'があったかをリスト格納
    count[i] += count[i-1]
    if S[i-1:i+1] == 'AC':
        count[i] += 1
for i in range(Q):
    l, r = map(int, input().split())
    print(count[r-1]-count[l-1])
Buggy python submission (verdict: Runtime Error):
S = int(input())
print('Heisei' if S[5]==0 and S[6]<5 else 'TBD')    

Fixed submission:
S = list(str(input()))
print('Heisei' if int(S[5])==0 and int(S[6])<5 else 'TBD')
Buggy python submission (verdict: Runtime Error):
N = int(input())
money = []
type = []
for i in range(N):
    m, t = input().split()
    money.append(int(m))
    type.append(t)
    
sum = 0
for i in range(N):
    if type[i] == 'JPY':
        sum += money[i]
    else :
        sum += money[i]*3.8*10**5
print(sum)

Fixed submission:
N = int(input())
money = []
type = []
for i in range(N):
    m, t = input().split()
    money.append(float(m))
    type.append(t)
    
sum = 0
for i in range(N):
    if type[i] == 'JPY':
        sum += money[i]
    else :
        sum += money[i]*3.8*10**5
print(sum)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split()))
print(A+B if B%A==0 else B-A)

Fixed submission:
A, B = map(int, input().split())
print(A+B if B%A==0 else B-A)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split()))
print(A+B if A%B==0 else B-A)

Fixed submission:
A, B = map(int, input().split())
print(A+B if B%A==0 else B-A)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
lists = [list(map(int, input().split())) for i in range(N)]
ans = set(lists[0][1:])
for i in range(1, N):
    ans = set(lists[i][1:]) * ans
print(*list(ans), sep='')

Fixed submission:
N, M = map(int, input().split())
lists = [list(map(int, input().split())) for i in range(N)]
ans = set(lists[0][1:])
for i in range(1, N):
    ans = set(lists[i][1:]) & ans
print(len(list(ans)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n%2!=0:
	print('Hello Wordl')
elif:
	print(int(input())+int(input()))

Fixed submission:
n=int(input())
print("Hello World" if n%2!=0 else int(input())+int(input()))

Buggy python submission (verdict: Runtime Error):
number = int(input())
A = int(input())
B = int(input())
if number ==1:
    print('Hello Wordl')
if number ==2:
    print(A+B)

Fixed submission:
n=int(input())
print("Hello World" if n%2!=0 else int(input())+int(input()))
Buggy python submission (verdict: Runtime Error):
print((int(input())-1)*(int(input()-1))

Fixed submission:
A, B =map(int, input().split())
print((A-1)*(B-1))
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split()))
if N%K==0:
    print(0)
else :
    print(N//K - N%K)

Fixed submission:
N, K = map(int, input().split())
print(0 if N%K==0 else 1)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split()))
if N%K==0:
    print(0)
else :
    print(N/K - N%K)

Fixed submission:
N, K = map(int, input().split())
print(0 if N%K==0 else 1)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split()))
if N%K==0:
    print(0)
else :
    print(N%K)

Fixed submission:
N, K = map(int, input().split())
print(0 if N%K==0 else 1)
Buggy python submission (verdict: Runtime Error):
S = input()
count = 0
if S[0] == 'A':
    S = S[1:]
    for i in range(1, len(S)-1):
        if S[i] == 'C':
            S = S[0:i] + S[i+1:]
            if S.islower():
                print('AC')
                break
            else:
                print('WA')
                break
    else:
        print('WA')
        break
else:
    print('WA')

Fixed submission:
S = input()
count = 0
if S[0] == 'A' and 'C' in S[2:-1] and S[1:].replace('C','',1).islower():
    print('AC')
else:
    print('WA')

Buggy python submission (verdict: Runtime Error):
S = input()
count = 0
if S[0] == 'A':
    S = S[1:]
    for i in range(1, len(S)-1):
        if S[i] == 'C':
            S = S[0:i] + S[i+1:]
            if S.islower():
                print('AC')
                break
else:
    print('WA')

Fixed submission:
S = input()
count = 0
if S[0] == 'A' and 'C' in S[2:-1] and S[1:].replace('C','',1).islower():
    print('AC')
else:
    print('WA')
Buggy python submission (verdict: Runtime Error):
N = int(input())
print('Yes' if 9 in N else 'No')

Fixed submission:
print("Yes" if input() in input()*2 else "No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
print(max(len(set(S[:i])&set(S[i:])) for i in range(N))

Fixed submission:
N = int(input())
S = list(input())
s = set(S)
count = 0
maxx = 0
for i in range(N): #切断場所
    for k in range(i):
        if S[k] in S[:i] and S[k] in S[i:] and S[k] not in S[:k]:
            count += 1
    maxx = max(maxx, count)
    count = 0
print(maxx)
Buggy python submission (verdict: Runtime Error):
X = int(input())
ans = 1
for b in range(1,x):
    for p in range(2,x):
        if X >= b**p and b**p > ans:
            ans = b**p
        else:
        	break
print(ans)

Fixed submission:
X = int(input())
ans = 1
for b in range(1,101):
    for p in range(2,10):
        if X >= b**p and b**p > ans:
            ans = b**p
print(ans)

Buggy python submission (verdict: Runtime Error):
X = int(input())
ans = 1
for b in range(1,x):
    for p in range(2,x):
        if X >= b**p and b**p > ans:
            ans = b**p
print(ans)

Fixed submission:
X = int(input())
ans = 1
for b in range(1,101):
    for p in range(2,10):
        if X >= b**p and b**p > ans:
            ans = b**p
print(ans)
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
m = sorted([int(input()) for i in range(N)])
print(3 + (X-m[0]-m[1]-m[2])//m[0])

Fixed submission:
N, X = map(int, input().split())
m = sorted([int(input()) for i in range(N)])
for i in range(N):
    X -= m[i]
print(N + X//m[0])
Buggy python submission (verdict: Runtime Error):
N = int(input())
LR = [list(map(int, input().split())) for i in range(N)]
a = 0
for i in range(N):
    a += (LR[i][1] - LR[i][0] + 1)
print(a)


Fixed submission:
A, B, X = map(int, input().split())
print('YES' if A <= X <= (A+B) else 'NO')
Buggy python submission (verdict: Runtime Error):
N, M, X = map(int, input().split())
A = list(map(int, input().split()))
right = 0
left = 0
for i in range(X, N):
    if i in A:
        right += 1
for i in range(0, X+1):
    if i in B:
        left += 1
print(min(right,left))

Fixed submission:
N, M, X = map(int, input().split())
A = list(map(int, input().split()))
right = 0
left = 0
for i in range(X, N):
    if i in A:
        right += 1
for i in range(0, X+1):
    if i in A:
        left += 1
print(min(right,left))
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.append(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list: 
    if A<=i<=B:
        print(i)

Fixed submission:
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.extend(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list:
    if A<=i<=B:
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
#bA
A, B, K = map(int, input().split())
list = [i for i in range(A, B+1)] #上限下限を先に決めておく
set1 = set(list[:K])
set2 = set(list[-K:])
print(*sorted(set1|set2), sep='\n')

Fixed submission:
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.extend(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list:
    if A<=i<=B:
        print(i)

Buggy python submission (verdict: Runtime Error):
#bA
A, B, K = map(int, input().split())
list = range(A, B+1) #上限下限を先に決めておく
set1 = set(:K)
set2 = set(-K:)
print(sorted(set1|set2))

Fixed submission:
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.extend(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list:
    if A<=i<=B:
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())
list = [i for i in range(A, B+1)]
list1 = list[:K]
list2 = list[(B-K-A+1):]
lists = sorted(set(list1 + list2))
for i in lists:
    print(i)

Fixed submission:
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.extend(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list:
    if A<=i<=B:
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())
list = [i for i in range(A, B+1)]
list1 = list[:K]
list2 = list[(B-K-A+1):]
for i in list1:
    print(i)
for i in list2:
    if i not in list1:
        print(i)

Fixed submission:
A, B, K = map(int, input().split())
list = [i for i in range(A, A+K)]
list.extend(i for i in range(B+1-K, B+1))
list = sorted(set(list))
for i in list:
    if A<=i<=B:
        print(i)
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = sorted([input() for i in range(N)])
M = int(input())
t = sorted([input() for i in range(M)])
a = 0
for i in s:
    for j in t:
        if a <= (s.count(s[i]) - t.count(t[j])):
            a = s.count(s[i]) - t.count(t[j])
print(a)

Fixed submission:
N = int(input())
s = [input() for i in range(N)]
M = int(input())
t = [input() for i in range(M)]
maxp = 0
for i in s:
    pre = s.count(i)-t.count(i)
    maxp = max(maxp,pre)
print(maxp)

Buggy python submission (verdict: Runtime Error):
N = int(input())
s = sorted([input() for i in range(N)])
M = int(input())
t = sorted([input() for i in range(M)])
a = 0
for i in s:
    for j in t:
        if a < s.count(s[i])-t.count(j):
            a = s.count(s[i])-t.count(j)
print(a)

Fixed submission:
N = int(input())
s = [input() for i in range(N)]
M = int(input())
t = [input() for i in range(M)]
maxp = 0
for i in s:
    pre = s.count(i)-t.count(i)
    maxp = max(maxp,pre)
print(maxp)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split()
count = 0
for i in range(A, B+1):
    if str(i) == str(i)[::-1]:
        count += 1
print(count)

Fixed submission:
A, B = map(int, input().split())
a = 0
for i in range(A, B+1):
    i = str(i)
    if i == i[::-1]:
        a += 1
print(a)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split()
count = 0
for i in range(A, B+1):
    if i == i[::-1]:
        count += 1
print(count)

Fixed submission:
A, B = map(int, input().split())
a = 0
for i in range(A, B+1):
    i = str(i)
    if i == i[::-1]:
        a += 1
print(a)

Buggy python submission (verdict: Runtime Error):
A, B = int(input())
count = 0
for i in range(A, B+1):
    if i == i[::-1]:
        count += 1
print(count)

Fixed submission:
A, B = map(int, input().split())
a = 0
for i in range(A, B+1):
    i = str(i)
    if i == i[::-1]:
        a += 1
print(a)
Buggy python submission (verdict: Runtime Error):
#6
N = int(input())
a = reversed(sorted(list(map(int, input().split()))))
Alice_list = []
Bob_list = []
for i in range(N):
    if i%2==0:     
        Alice_list.append(a[i])
    else:
        Bob_list.append(a[i])
print(sum(Alice_list)-sum(Bob_list))

Fixed submission:
#6
N = int(input())
a = sorted(list(map(int, input().split())))
Alice_list = []
Bob_list = []
for i in range(1, N+1):
    if i%2==1:     
        Alice_list.append(a[-i])
    else:
        Bob_list.append(a[-i])
print(sum(Alice_list)-sum(Bob_list))
Buggy python submission (verdict: Runtime Error):
N,Y=map(int,input().split())
answer=-1,-1,-1
for x in range(N+1):
    for y in range(N-x+1):
        z=N-x-y
        if 0<=z<=2000 and 10000*x+5000*y+1000*z==Y:
            answer=x,y,z
            break
    break
print(*answer)

Fixed submission:
S = input()
print(S.replace("7","8",1))

Buggy python submission (verdict: Runtime Error):
N,Y=map(int,input().split())
answer=-1,-1,-1
for x in range(N+1):
    for y in range(N-x+1):
        z=N-x-y
        if 0<=z<=2000 and 10000*x+5000*y+1000*z==Y:
            answer=x,y,z
            break
      	else:
  	        continue
    break
print(*answer)

Fixed submission:
S = input()
print(S.replace("7","8",1))
Buggy python submission (verdict: Runtime Error):
N = int(input())
d = [int(input()) for i in range(N)]
print(len8set(d)) 

Fixed submission:
#7
N = int(input())
d = [int(input()) for i in range(N)]
d.sort(reverse=True)
count = 1
for i in range(N-1):
    if d[i] > d[i+1]:
        count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N, Y = map(int, input().split())
flag = False
for x in range(0, N+1):
    for y in range(0, N+1-x):
        for z in range(0, N+1-x-y):
            if 10000*x + 5000*y + 1000*z == Y and x+y+z==N:
                print(x,y,z)
                flag = True
                break
        if flag:
            break
    if flag:
        break
else:
    print('-1 -1 -1')

Fixed submission:
N,Y=map(int,input().split())
answer=-1,-1,-1
for x in range(N+1):
    for y in range(N-x+1):
        z=N-x-y
        if 0<=z<=2000 and 10000*x+5000*y+1000*z==Y:
            answer=x,y,z
            break
    else:
        continue
    break
print(*answer)

Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())
ans = 0
a = 0
b = 0
c = 0
for a in range(N+1):
    for b in range(N-a+1):
        c = N - a - b
        if (a*10000 + b*5000 + c*1000) == Y:
            ans = 1
            x = a
            y = b
            z = c
            flag = True #フラグ変数で代用しても良い
            break
    if flag:
        break
if ans == 1:
    print(x,y,z)
else:
    print( '-1 -1 -1')

Fixed submission:
N,Y=map(int,input().split())
answer=-1,-1,-1
for x in range(N+1):
    for y in range(N-x+1):
        z=N-x-y
        if 0<=z<=2000 and 10000*x+5000*y+1000*z==Y:
            answer=x,y,z
            break
    else:
        continue
    break
print(*answer)

Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())
x = 0
y = 0
z = 0
ans = 0
for i in range(1,N):
    for k in range(1,N):
        z = N - i - k
        if (i*10000 + k*5000 + z*1000 )== Y and:
            x = i
            y = k
            ans = 1
            break
if ans == 1:
    print(x,y,z)
else:
    print( '-1 -1 -1')

Fixed submission:
N,Y=map(int,input().split())
answer=-1,-1,-1
for x in range(N+1):
    for y in range(N-x+1):
        z=N-x-y
        if 0<=z<=2000 and 10000*x+5000*y+1000*z==Y:
            answer=x,y,z
            break
    else:
        continue
    break
print(*answer)
Buggy python submission (verdict: Runtime Error):
print(48 - int(input())

Fixed submission:
M = int(input())
print(48 -M)
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
sum = 0
ans = 0
for i in range(1, N+1):
    for k in range(len(str(i))-1):
        i = str(i)
        sum += int(i[k])
    if A<=sum<=B:
        ans += int
    sum = 0
print(ans)

Fixed submission:
#9
N, A, B = map(int, input().split())
sum = 0
ans = 0
for i in range(1, N+1):
    i = str(i)
    for k in range(len(i)):
        sum += int(i[k])
    if A<=sum<=B:
        ans += int(i)
    sum = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
s = sorted(input())
t = sorted(input()).reverse()
print('Yes' if s<t else 'No')

Fixed submission:
s = sorted(list(str(input())))
t = reversed(sorted(list(str(input()))))
S = str()
T = str()
for i in s:
    S += i
for k in t:
    T += k
print('Yes' if S<T else 'No')

Buggy python submission (verdict: Runtime Error):
s = sorted(input())
t = reversed(sorted(input()))
print('Yes' if s<t else 'No')

Fixed submission:
s = sorted(list(str(input())))
t = reversed(sorted(list(str(input()))))
S = str()
T = str()
for i in s:
    S += i
for k in t:
    T += k
print('Yes' if S<T else 'No')

Buggy python submission (verdict: Runtime Error):
s = sorted(list(str(input())))
t = reversed(sorted(list(str(input()))))
print('Yes' if s<t else 'No')

Fixed submission:
s = sorted(list(str(input())))
t = reversed(sorted(list(str(input()))))
S = str()
T = str()
for i in s:
    S += i
for k in t:
    T += k
print('Yes' if S<T else 'No')
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):
N = int(input())
print('Yes' if 9 in N else 'No')

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

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

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

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

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i in range(N)]
B = 0
for i in A:
    if A.count(i) != 0:
        if A.count(i)%2 == 1: 
            B += 1
        else:
            while i in A:A.remove(i)
print(B)

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i in range(N)]
B=0
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 1: 
        B += 1
    else:
        A.remove(i)
print(B)

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i in range(N)]
B=0
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 0: 
        A.remove(i)
    else:
        B += 1
print(B)

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i in range(N)]
for i in A:
    #if A.count(i) >= 1:
    if A.count(i)%2 == 0: 
        A.remove(i)   
print(B)

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i in range(N)]
for i in A:
    #if A.count(i) >= 1:
        if A.count(i)%2 == 0: 
            A.remove(i)   
print(B)

Fixed submission:
N = input()
print('Yes' if '9' in N else 'No')