Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=int(input())
B=int(input())
if N==1:
  print("Hello World")
else:
  print(A+B)

Fixed submission:
N=int(input())
if N==1:
    print("Hello World")
else:
    A=int(input())
    B=int(input())
    print(A+B)
Buggy python submission (verdict: Runtime Error):
N=int(i)
W=[int(input()) for i in range(N)]
for i in range(N-1):
  if W[i:].find(W[i])==True:
    print("No")
  elif W[i][-1]!=W[i+1][0]:
    print("No")
else:
  print("Yes")

Fixed submission:
N=int(input())
W=[input() for i in range(N)]
for i in range(N-1):
    if W[i] in W[i+1:]:
        print("No")
        break
    elif W[i][-1]!=W[i+1][0]:
        print("No")
        break
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
a,b= i for i in input().split()
for i in range(100):
	if int(a+b)/(i*i)==1:
      print("Yes")
print("No")

Fixed submission:
a,b=(i for i in input().split())
tmp=int(a+b)
if tmp**0.5==int(tmp**0.5):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N,A,B=int(i) for i in input().split()
if A*N<B:
  print(A*N)
else:
  print(B)

Fixed submission:
N,A,B=(int(i) for i in input().split())
if A*N<B:
    print(A*N)
else:
    print(B)
Buggy python submission (verdict: Runtime Error):
X,Y=(int(i) for i in input().split())
left=ord(X)-55
right=ord(Y)-55
if left==right:
  print("=")
elif left>right:
  print(">")
else:
  print("<")

Fixed submission:
X,Y=(i for i in input().split())
left=ord(X)-55
right=ord(Y)-55
if left==right:
    print("=")
elif left>right:
    print(">")
else:
    print("<")
Buggy python submission (verdict: Runtime Error):
R=input()
G=input()
print(G*2-R)

Fixed submission:
R=int(input())
G=int(input())
print(G*2-R)
Buggy python submission (verdict: Runtime Error):
A=[int(i) for i in input().split]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")

Fixed submission:
A=[int(i) for i in input().split()]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
A=[int(i) for i in input().split]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")

Fixed submission:
A=[int(i) for i in input().split()]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
def gcd(a, b):
	if a < b:
		a,b = b,a
	while b:
		a, b = b, a % b
	return a
def lcm(a, b): 
	return (a*b)//gcd(a,b)

a,b,c,d = map(int,input().split())
a3 = b // c - (a-1) // c
b3 = b // d - (a-1) // d
if c < d:
	c,d = d,c
width = b - a + 1
c3 = b//lcm(c,d) - (a-1)//lcm(c,d)
print(int(width - a3 - b3 + c3))

if __name__ == '__main__':
	main()

Fixed submission:
def gcd(a, b):
	if a < b:
		a,b = b,a
	while b:
		a, b = b, a % b
	return a
def lcm(a, b): 
	return (a*b)//gcd(a,b)

a,b,c,d = map(int,input().split())
a3 = b // c - (a-1) // c
b3 = b // d - (a-1) // d
if c < d:
	c,d = d,c
width = b - a + 1
c3 = b//lcm(c,d) - (a-1)//lcm(c,d)
print(int(width - a3 - b3 + c3))
Buggy python submission (verdict: Runtime Error):
import java.util.Scanner;
class Main{
    public static void main(String args[]){
        Scanner scanner = new Scanner(System.in);
        int A = scanner.nextInt();
        int P = scanner.nextInt();
        int ans = (A*3+P)/2;
        System.out.println(ans);
    }
}

Fixed submission:
A,P = map(int,input().split())
print(int((A*3+P)/2))
Buggy python submission (verdict: Runtime Error):
def gcd(a, b):
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    c = a % b
    return gcd(b, c)
N = int(input())
a = list(map(int,input().split()))
if N==2:
    print(max(a))
else:
    gcd1 = gcd(a[0],a[1])
    gcd2 = gcd(a[0],a[2])
    gcd3 = gcd(a[1],a[2])
    flag1 = flag2 = flag3 = 0
    for i in range(N):
        if a[i]%gcd1 == 0:
            flag1 += 1
        if a[i]%gcd2 == 0:
            flag2 += 1
        if a[i]%gcd3 == 0:
            flag3 += 1
    ans = []
    if flag1 == N-1:
        ans.append(gcd1)
    if flag2 == N-1:
        ans.append(gcd2)
    if flag3 == N-1:
        ans.append(gcd3)
    print(max(ans))

Fixed submission:
def gcd(a,b):
    if a < b:
        a,b = b,a
    if b == 0:
        return a
    return gcd(b,a%b)

n = int(input())
a = list(map(int, input().split()))
rs, ls = [0], [0]
for i in range(n-1):
    rs.append(gcd(rs[i], a[i]))
    ls.append(gcd(ls[i], a[-i-1]))
gcd_list = [gcd(r,l) for r, l in zip(rs, ls[::-1])]
print(max(gcd_list))

Buggy python submission (verdict: Runtime Error):
def gcd(a, b):
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    c = a % b
    return gcd(b, c)
n = int(input())
a = list(map(int,input().split()))
li = []
li2 = []
for i in range(n-1):
    li.append(gcd(a[i],a[i+1]))
for i in range(n-2):
    li2.append(gcd(a[i],a[i+2]))
if n <= 3:
    li = set(li) | set(li2)
    ans = max(li)
    print(ans)
else:
    li = set(li) & set(li2)
    ans = max(li)
    print(ans)

Fixed submission:
def gcd(a,b):
    if a < b:
        a,b = b,a
    if b == 0:
        return a
    return gcd(b,a%b)

n = int(input())
a = list(map(int, input().split()))
rs, ls = [0], [0]
for i in range(n-1):
    rs.append(gcd(rs[i], a[i]))
    ls.append(gcd(ls[i], a[-i-1]))
gcd_list = [gcd(r,l) for r, l in zip(rs, ls[::-1])]
print(max(gcd_list))

Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
a = list(map(int,input().split()))
li = []
li2 = []
for i in range(n-1):
    li.append(math.gcd(a[i],a[i+1]))
for i in range(n-2):
    li2.append(math.gcd(a[i],a[i+2]))
li = set(li)  | set(li2)
ans = max(li)
print(ans)

Fixed submission:
def gcd(a,b):
    if a < b:
        a,b = b,a
    if b == 0:
        return a
    return gcd(b,a%b)

n = int(input())
a = list(map(int, input().split()))
rs, ls = [0], [0]
for i in range(n-1):
    rs.append(gcd(rs[i], a[i]))
    ls.append(gcd(ls[i], a[-i-1]))
gcd_list = [gcd(r,l) for r, l in zip(rs, ls[::-1])]
print(max(gcd_list))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = list(input())
black1 = s.count('#')
white1 = s.count('.')
if black1 > 0:
    for i in reversed(s):
        if i == '#':
            n -= 1
        else:
            break
    l1 = s[:n]
    black2 = l1.count('#')
    b = l1.index('#')
    l2 = l1[b:]
    white2 = l2.count('.')
    l3 = s[b:]
    black3=l3.count('#')
    print(min(black1,white1,black2,white2,black3))
else:
    print('0')

Fixed submission:
n = int(input())
s = list(input())
ans = white = s.count('.')
black = 0
for i in s:
    if i == '.':
        white -= 1
    else:
        black += 1
    ans = min(ans,white+black)
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
A,B = map(int,input().split())
if B < A:
    n = A
    A -= 1
else:
    n = B
    B -= 1
if B < A:
    n += A
else:
    n += B

print(n)

Fixed submission:
A,B = map(int,input().split())
if B < A:
    n = A
    A -= 1
else:
    n = B
    B -= 1
if B < A:
    n += A
else:
    n += B

print(n)
Buggy python submission (verdict: Runtime Error):
S = list(input())
stlen = len(S) 
if len(S)%2 == 0:
    a = '10'*(stlen/2)
    b = '01'*(stlen/2)
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))
else:
    a = '10'*(int(stlen/2))+'1'
    b = '01'*(int(stlen/2))+'0'
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))

Fixed submission:
S = list(input())
stlen = len(S) 
if len(S)%2 == 0:
    a = '10'*(int(stlen/2))
    b = '01'*(int(stlen/2))
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))
else:
    a = '10'*(int(stlen/2))+'1'
    b = '01'*(int(stlen/2))+'0'
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))

Buggy python submission (verdict: Runtime Error):
S = list(input())
stlen = len(S) 
if len(S)%2 == 0:
    a = '10'*(stlen/2)
    b = '01'*(stlen/2)
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))
else:
    a = '10'*(int(stlen/2))+'1'
    b = '01'*int((stlen/2))+'0'
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))

Fixed submission:
S = list(input())
stlen = len(S) 
if len(S)%2 == 0:
    a = '10'*(int(stlen/2))
    b = '01'*(int(stlen/2))
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))
else:
    a = '10'*(int(stlen/2))+'1'
    b = '01'*(int(stlen/2))+'0'
    counta = countb = 0
    for i in range(stlen):
        if a[i] != S[i]:
            counta += 1
        if b[i] != S[i]:
            countb += 1
    print(min(counta,countb))
Buggy python submission (verdict: Runtime Error):
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        ans.append(counter)
        counter = 0
print(max(ans))

Fixed submission:
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        counter = 0
    ans.append(counter)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        ans.append(counter)
        conuter = 0
print(max(ans))

Fixed submission:
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        counter = 0
    ans.append(counter)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        ans.append(counter)
        conter = 0

print(max(ans))

Fixed submission:
s = input()
ans = []
counter = 0
for i in s:
    if i in 'ATGC':
        counter += 1
    else:
        counter = 0
    ans.append(counter)
print(max(ans))
Buggy python submission (verdict: Time Limit Exceeded):
n,q = map(int,input().split())
S = input()
d = [0] * n
for i in range(n - 1):
        if S[i]+S[i + 1] == 'AC':
                d[i+1] += 1
for i in range(q):
        r,l = map(int,input().split())
        su = 0
        for j in range(r-1,l):
                su += d[j]
        print(su-d[r-1])

Fixed submission:
n,q = map(int,input().split())
S = input()
d = [0] * n
counter = 1
for i in range(n - 1):
    d[i] = counter
    if S[i]+S[i + 1] == 'AC':
            d[i+1] = counter
            counter += 1
d[len(S)-1] = counter
for i in range(q):
    r,l = map(int,input().split())
    print(d[l-1]-d[r-1])

Buggy python submission (verdict: Runtime Error):
n,q = map(int,input().split())
S = input()
d = [0] * n
for i in range(n - 1):
        if S[i]+S[i + 1] == 'AC':
                d += 1
for i in range(q):
        r,l = map(int,input().split())
        su = 0
        for j in range(r-1,l):
                su += d[j]
        print(su-d[r-1])

Fixed submission:
n,q = map(int,input().split())
S = input()
d = [0] * n
counter = 1
for i in range(n - 1):
    d[i] = counter
    if S[i]+S[i + 1] == 'AC':
            d[i+1] = counter
            counter += 1
d[len(S)-1] = counter
for i in range(q):
    r,l = map(int,input().split())
    print(d[l-1]-d[r-1])

Buggy python submission (verdict: Time Limit Exceeded):
n,q = map(int,input().split())
S = input()
d = [0] * n
for i in range(n - 1):
        if S[i]+S[i + 1] == 'AC':
                d[i+1] += 1
for i in range(q):
        r,l = map(int,input().split())
        su = 0
        for j in range(r-1,l):
                su += d[j]
        print(su-d[r-1])

Fixed submission:
n,q = map(int,input().split())
S = input()
d = [0] * n
counter = 1
for i in range(n - 1):
    d[i] = counter
    if S[i]+S[i + 1] == 'AC':
            d[i+1] = counter
            counter += 1
d[len(S)-1] = counter
for i in range(q):
    r,l = map(int,input().split())
    print(d[l-1]-d[r-1])
Buggy python submission (verdict: Runtime Error):
def gcd(m,n):
    while n:
        m,n = n, m%n
    return m
n = int(input())
m = map(int,input().split())
ans = m[0]
for i in range(1,n):
    ans = gcd(m[i],ans)
print(ans)

Fixed submission:
def gcd(m,n):
    while n:
        m,n = n, m%n
    return m
n = int(input())
m = list(map(int,input().split()))
ans = m[0]
for i in range(1,n):
    ans = gcd(m[i],ans)
print(ans)
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
l = list(map(int,input().split()))
if M <= N:
    print('0')
else:
    l.sort()
    li = []
    for i in range(M-1):
        difference  = abs(l[i]-l[i+1])
        li.append(difference)
    li.sort().reverse()
    dif = 0
    for i in range(N-1):
        dif += li[i]
    print(l[M-1]-l[0]-dif)

Fixed submission:
N,M = map(int,input().split())
l = list(map(int,input().split()))
if M <= N:
    print('0')
else:
    l.sort()
    li = []
    for i in range(M-1):
        difference  = abs(l[i]-l[i+1])
        li.append(difference)
    li.sort()
    li.reverse()
    dif = 0
    for i in range(N-1):
        dif += li[i]
    print(l[M-1]-l[0]-dif)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = min(abs(s[i:i+3] - 753) for i in range(len(s) -2))
print(ans)

Fixed submission:
n=input()
a=[]
for i in range(len(n)-2):
    a.append(abs(int(n[i:i+3])-753))
print(min(a))
Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
h = list(map(int, input().split()))
x = [abs(a-(t-b*0.006)) for b in h]
print(x.index(min(x)+1))

Fixed submission:
n=int(input())
t,a=map(int,input().split())
h = list(map(int, input().split()))
x = [abs(a-(t-b*0.006)) for b in h]
print(x.index(min(x))+1)
Buggy python submission (verdict: Runtime Error):
n = input()

if len(n) == 2:
    print(n)
else if len(n) == 3:
    print(n[::-1])

Fixed submission:
n = input()

if len(n) == 2:
    print(n)
elif len(n) == 3:
    print(n[::-1])
Buggy python submission (verdict: Runtime Error):
from collections import Counter
n = int(input())
v = list(map(int,input().split()))
even = Counter(v[::2]).most_common(2)
odd = Counter(n[1::2]).most_common(2)
if even[0][0] != odd[0][0]:
    ans =  n - even[0][1] - odd[0][1]
else:
    if len(even) == 1:
        ans = n//2
    else:
        ans =  n - max(even[0][1] + odd[1][1],even[1][1],odd[0][1])
print(ans)


Fixed submission:
from collections import Counter
n = int(input())
v = list(map(int,input().split()))
even = Counter(v[::2]).most_common(2)
odd = Counter(v[1::2]).most_common(2)

if even[0][0] != odd[0][0]:
    ans =  n - even[0][1] - odd[0][1]
else:
    if len(even) == 1 or len(odd)==1:#単一の要素からなる場合ex.)1111
        ans = n//2
    else:
        ans =  n - max(even[0][1] + odd[1][1],even[1][1]+odd[0][1])
print(ans)

Buggy python submission (verdict: Runtime Error):
from collections import Counter
n = int(input())
v = list(map(int,input().split()))
even = Counter(v[::2]).most_common(2)
odd = Counter(n[1::2]).most_common(2)
if even[0][0] != odd[0][0]:
    ans =  n - even[0][1] - odd[0][1]
else:
    if len(even) == 1:
        ans = n//2:
    else:
        ans =  n - max(even[0][1] + odd[1][1],even[1][1],odd[0][1])
print(ans)

Fixed submission:
from collections import Counter
n = int(input())
v = list(map(int,input().split()))
even = Counter(v[::2]).most_common(2)
odd = Counter(v[1::2]).most_common(2)

if even[0][0] != odd[0][0]:
    ans =  n - even[0][1] - odd[0][1]
else:
    if len(even) == 1 or len(odd)==1:#単一の要素からなる場合ex.)1111
        ans = n//2
    else:
        ans =  n - max(even[0][1] + odd[1][1],even[1][1]+odd[0][1])
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n < 1200 :
    print(ABC)
elif n < 2800 :
    print(ARC)
else :
    print(AGC)
    

Fixed submission:
n = int(input())

if 0 <= n and n < 1200 :
    print("ABC")
elif n < 2800 :
    print("ARC")
else :
    print("AGC")
Buggy python submission (verdict: Runtime Error):
n = input().split(" ")

a = abs((int(n[1])-int(n[0]))+abs((int(n[2])-int(n[1]))
b = abs((int(n[2])-int(n[0]))+abs((int(n[1])-int(n[2]))
c = abs((int(n[2])-int(n[1]))+abs((int(n[0])-int(n[2]))
d = abs((int(n[0])-int(n[1]))+abs((int(n[2])-int(n[0]))
e = abs((int(n[1])-int(n[2]))+abs((int(n[0])-int(n[1]))
f = abs((int(n[0])-int(n[2]))+abs((int(n[1])-int(n[0]))

w = min(a,b,c,d,e,f)

print(w)

Fixed submission:
n = list(map(int,input().split()))
n.sort()
ans = n[2]-n[0]
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys

s = input()
t = input()

a = int(len(s))

for i in range(0,a) :
    s = s[:a-1:]+s[a-1::]
    if s == t :
        print("Yes")
        sys.exist()

print("No")

Fixed submission:
import sys

s = input()
t = input()

a = int(len(s))

for i in range(0,a) :
    s = s[a-1::]+s[:a-1:]
    if s == t :
        print("Yes")
        sys.exit()

print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

a.sort()

for m in range(0,int(a[n])) :
    for j in range(0,n) :
        f[m] += m//a[j]

f.sort()

print(f[n])

Fixed submission:
N = int(input())
a = [int(i) for i in input().split()]
print(sum(a)-N)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input().split(" ")

max = a[0]
for i in range(1,n) :
    if max < a[i] :
        max = a[i]

f = 0
for j in range(1,int(max)) :
    for d in range(0,n) :
        f[j] += j//a[d]

max1 = 0
for i in range(1,int(max)):
    if max1 < f[i] :
        max1 = f[i]

print(max1)

Fixed submission:
N = int(input())
a = [int(i) for i in input().split()]
print(sum(a)-N)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split(''))
res = (1900*m+100(n-m))*2**m
print(res)

Fixed submission:
n,m = map(int,input().split())
res = (1900*m+100*(n-m))*(2**m)
print(res)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
print((1900*m+100(n-m))*2**m)


Fixed submission:
n,m = map(int,input().split())
res = (1900*m+100*(n-m))*(2**m)
print(res)
Buggy python submission (verdict: Runtime Error):
numlist = list(input().split())
print(sorted(numlist,key=lambda x:numlist.sount(x))[0])

Fixed submission:
numlist = list(input().split())
print(sorted(numlist,key=lambda x:numlist.count(x))[0])
Buggy python submission (verdict: Runtime Error):
n,k=int(input().split())
if (n+k)%3 == 0:
  print("Possible")
else:
  print("Impossible")

Fixed submission:
a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
    print("Possible")
else:
    print("Impossible")
Buggy python submission (verdict: Runtime Error):
if A/10 >1 and B/10 > 1:
  print(A*B)
else:
  print(-1)

Fixed submission:
A,B=map(int,input().split())
if A/10 <1 and B/10 < 1:
  print(A*B)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
T, A = (int(x) for x in input().split())
altitude_list = [int(x) for x in input().split()]
dif_list = list(map(lambda x: abs(A - (T - x * 0.006)), altitude_list))
print(dif_list.index(min(dif_list)) + 1)

Fixed submission:
X, Y = (int(x) for x in input().split())
print(X + int(Y / 2))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A=(1,2,3,4,5,6,7,8,9)
B=(1,2,3,4,5,6,7,8,9)
count=0
for c in A:
  for d in B:
    e=c*d
    if N/e == 1 and N%e==0:
      count=count+1
if count >= 1 :
  print('Yes')
else:
  print('No')

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

Buggy python submission (verdict: Runtime Error):
N = int(input())
A=(1,2,3,4,5,6,7,8,9)
B=(1,2,3,4,5,6,7,8,9)
count=0
for a in A:
  for b in B:
    c=a*b
    if N/c == 1 and N%c==0:
      count=count+1
if count >= 1 :
  print('Yes')
else:
  print('No')

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

Buggy python submission (verdict: Runtime Error):
N = int(input())
A=(1,2,3,4,5,6,7,8,9)
B=(1,2,3,4,5,6,7,8,9)
count=0
for a in A:
  for b in B:
    if N/(a*b) == 1 and N%(a*b)==0:
      count=count+1
if count >= 1 :
  print('Yes')
else:
  print('No')

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

Buggy python submission (verdict: Runtime Error):
N = int(input())
A=(1,2,3,4,5,6,7,8,9)
B=(1,2,3,4,5,6,7,8,9)
count=0
for a in A:
  for b in B:
    if N/(a*b) == 1 and N%(a*b)==0:
      count=count+1
if count>=1:
  print('Yes')
else:
  print('No')

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

Buggy python submission (verdict: Runtime Error):
N = int(input())
A=(1,2,3,4,5,6,7,8,9)
B=(1,2,3,4,5,6,7,8,9)
count=0
for a in A:
  for b in B:
    if N/(a*b) == 1 and N%(a*b)==0:
      count=count+1
print(count)
if count>=1:
  print('Yes')
else:
  print('No')

Fixed submission:
A, B = map(int, input().split())
if A >= 10 or B >=10:
  print(-1)
else:
  print(A*B)
Buggy python submission (verdict: Runtime Error):
A = map(int, input().split())
E=A[0]
B=A[1]
C=A[2]
D=C-(E-B)
print(D)

Fixed submission:
A,B,C = map(int, input().split())
D=C-(A-B)
if D > 0:
    print(D)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
A = map(int, input().split())
A=A[0]
B=A[1]
C=A[2]
D=C-(A-B)
print(D)

Fixed submission:
A,B,C = map(int, input().split())
D=C-(A-B)
if D > 0:
    print(D)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
A = map(int, input().split())
print(A[2]-(A[1]-A[0]))

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

Fixed submission:
A,B = map(int, input().split())
C=(A+B)/2
D=A+B
if D %2 > 0:
    print('IMPOSSIBLE')
elif D %2 == 0:
    print((A+B)//2)
Buggy python submission (verdict: Runtime Error):
N, D = map(int, input().split())
B=2*D
A=N//2B+1
print(A)

Fixed submission:
N, D = map(int, input().split())
B=2*D+1
if N % B == 0:
  A=N//B
else:
  A=N//B+1
print(A)

Buggy python submission (verdict: Runtime Error):
N, D = map(int, input().split())
A=N//2D+1
print(A)

Fixed submission:
N, D = map(int, input().split())
B=2*D+1
if N % B == 0:
  A=N//B
else:
  A=N//B+1
print(A)
Buggy python submission (verdict: Runtime Error):
S=input()
if S[0] == S[1] and S[2] == S[3] and S[0] != S[2]:
    print(Yes)
elif S[0] == S[2] and S[1] == S[3] and S[0] != S[1]:
    print(Yes)
elif S[0] == S[3] and S[1] == S[2] and S[0] != S[1]:
    print(Yes)
else:
    print(No)

Fixed submission:
S=input()
if S[0] == S[1] and S[2] == S[3] and S[0] != S[2]:
    print('Yes')
elif S[0] == S[2] and S[1] == S[3] and S[0] != S[1]:
    print('Yes')
elif S[0] == S[3] and S[1] == S[2] and S[0] != S[1]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
S=input()
if S[0]==S[1] and S[2]==S[3] and S[0]!=S[2]:
  print(Yes)
elif S[0]==S[2] and S[1]==S[3] and S[0]!=S[1]:
  print(Yes)
elif S[0]==S[3] and S[1]==S[2] and S[0]!=S[1]:
  print(Yes)
else:
  print(No)

Fixed submission:
S=input()
if S[0] == S[1] and S[2] == S[3] and S[0] != S[2]:
    print('Yes')
elif S[0] == S[2] and S[1] == S[3] and S[0] != S[1]:
    print('Yes')
elif S[0] == S[3] and S[1] == S[2] and S[0] != S[1]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
S=int(input())
if S[0]==S[1]:
  print('Bad')
elif S[1]==S[2]:
  print('Bad')
elif S[2]==S[3]:
  print('Bad')
else:
  print('Good')

Fixed submission:
S=input()
if S[0]==S[1]:
  print('Bad')
elif S[1]==S[2]:
  print('Bad')
elif S[2]==S[3]:
  print('Bad')
else:
  print('Good')
Buggy python submission (verdict: Runtime Error):
A,P= map(int, input().split())
print((3*A+P)%2))


Fixed submission:
A,P= map(int, input().split())
B=(3*A+P) // 2
print(B)