Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b,x = map(int,input().split())
def f(p):
    q = p//x
ans = f(b) - f(a-1)
print(ans)

Fixed submission:
a,b,x = map(int,input().split())
def f(p):
    q = p//x
    return q
ans = f(b) - f(a-1)
print(ans)
Buggy python submission (verdict: Runtime Error):
n,t = map(int,input())
A = list(map(int,input().split()))
m = 10**9+1 
M = -1
ans = 0
for i in range(n):
    x = A[i]
    m = min(x)
    p = x-A
    if p > M:
        ans = 0
        M = p
    elif p == M:
        ans += 1
print(ans)

Fixed submission:
n,t = map(int,input().split())
A = list(map(int,input().split()))
m = 10**9+1 
M = -1
ans = 1
for i in range(n):
    x = A[i]
    m = min(x,m)
    p = x-m
    if p > M:
        ans = 1
        M = p
    elif p == M:
        ans += 1
if M <= 0:
    ans = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a == b:
    i = 1
if b == c:
    j = 1
if c == a:
    k = 1
if a == b & b == c:
    l = -1
print(3-(i+j+k+l))

Fixed submission:
a,b,c = map(int,input().split())
i,j,k,l = 0,0,0,0
if a == b:
    i = 1
if b == c:
    j = 1
if c == a:
    k = 1
if a == b & b == c:
    l = -1
print(3-(i+j+k+l))
Buggy python submission (verdict: Runtime Error):
S = input()
n = len(S)
ans = 0
s = 0
t = 0
for i in range(N):
    x = S[i]
    if x == 'S':
        s += 1
        if t > 0:
            if s > t:
                s -= t
            else:
                t = t-s
                ans += t
                s = 0
        else:
            t += 1
ans += s
print(ans)

Fixed submission:
S = input()
n = len(S)
ans = 0
s = 0
t = 0
for i in range(n):
    x = S[i]
    if x == 'S':
        s += 1
    else:
        if s > 0:
            s -= 1
        else:
            ans += 1
ans += s
print(ans)
Buggy python submission (verdict: Runtime Error):
S_a = input()
S_b = input()
S_c = input()
a = []
b = []
c = []
for i in range(len(S_a)):
    a.append(S_a[i])
for j in range(len(S_b)):
    b.append(S_b[i])
for k in range(len(S_c)):
    c.append(S_c[i])
l = a
winner = 'A'
wlile len(l) > 0:
    x = l.pop(0)
    if x == 'a':
        l = a
        winner = 'A'
    elif x == 'b':
        l = b
        winner = 'B'
    else:
        l = c
        winner = 'C'
print(winner)

Fixed submission:
S_a = input()
S_b = input()
S_c = input()
a = []
b = []
c = []
for i in range(len(S_a)):
    a.append(S_a[i])
for j in range(len(S_b)):
    b.append(S_b[j])
for k in range(len(S_c)):
    c.append(S_c[k])
l = a
winner = 'A'
while len(l) > 0:
    x = l.pop(0)
    if x == 'a':
        l = a
        winner = 'A'
    elif x == 'b':
        l = b
        winner = 'B'
    else:
        l = c
        winner = 'C'
print(winner)
Buggy python submission (verdict: Runtime Error):
S = intinput()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)


Fixed submission:
S = input()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

Buggy python submission (verdict: Runtime Error):
S = int(input())
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

Fixed submission:
S = input()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)

Buggy python submission (verdict: Runtime Error):
S = str(input())

def plus(a,b,c):
    x = a[0:b+1] + c + a[b+1:len(a)]
    return(x)
A = [S]
while len(A) != 2**(len(S)):
    for i in range(len(S)-1):
        for j in range(len(A)):
            x = A[j]
            y = plus(x,i,'+')
            A.append(y)
s = 0
for i in range(len(A)):
    x = A[i]
    p = 0
    q = 0
    for j in range(len(x)):
        if x[j] == '+':
            q = j - 1
            m = x[p:q]
            s += int(m)
            p = j + 1
        elif j == len(x):
            q = len(x)
            m = x[p:q]
            s += int(m)
print(s)
            
        
        
    
    

Fixed submission:
S = input()
n = len(S)
ans = 0
for i in range(2**(n-1)):
    s = S[0]
    for j in range(n-1):
        if (i >> j) & 1:
            s += '+'
        s += S[j+1]
    ans += eval(s)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*50+1)] for j in range(N+1)] for k in range(N+1)]
for i in range(N+1):
    dp[i][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(1,N+1):
        for k in range(N*50+1):
            if k < x:
                dp[i][j][k] = dp[i-1][j][k]
                
            elif j > i:
                dp[i][j][k] = 0
                
            else: 
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
ans = 0
for i in range(1,N+1):
    ans += dp[N][i][A*i]
print(ans)

Fixed submission:
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*50+1)] for j in range(N+1)] for k in range(N+1)]
for i in range(N+1):
    dp[i][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(1,N+1):
        for k in range(N*50+1):
            if k < x:
                dp[i][j][k] = dp[i-1][j][k]
                
            elif j > i:
                dp[i][j][k] = 0
                
            else: 
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
ans = 0
for i in range(1,N+1):
    ans += dp[N][i][A*i]
print(ans)

Buggy python submission (verdict: Runtime Error):
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*A+1)] for j in range(N+1)] for k in range(N+1)]
dp[0][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(N):
        for k in range(N*M+1):
            if k < x:
                dp[i][j][k] += dp[i-1][j][k]
            elif j > i:
                dp[i][j][k] = 0
            else:
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
for i in range(1,N+1):
    ans += dp[N][i][N*i]
print(ans)
                

Fixed submission:
N, A = map(int,input().split())
X = list(map(int,input().split()))
dp = [[[0 for i in range(N*50+1)] for j in range(N+1)] for k in range(N+1)]
for i in range(N+1):
    dp[i][0][0] = 1
for i in range(1,N+1):
    x = X[i-1]
    for j in range(1,N+1):
        for k in range(N*50+1):
            if k < x:
                dp[i][j][k] = dp[i-1][j][k]
                
            elif j > i:
                dp[i][j][k] = 0
                
            else: 
                dp[i][j][k] += dp[i-1][j][k] + dp[i-1][j-1][k-x]
ans = 0
for i in range(1,N+1):
    ans += dp[N][i][A*i]
print(ans)
Buggy python submission (verdict: Runtime Error):
s = str(input())
n = len(s)
a = []
for i in range(n):
    if s[i] != 'B':
        a.append(s[i])
    else:
        if len(s) != 0:
            a.pop(-1)
t =''
m = len(a)
for j in range(m):
    t += a[j]
print(t)

Fixed submission:
s = str(input())
n = len(s)
a = []
for i in range(n):
    if s[i] != 'B':
        a.append(s[i])
    else:
        if len(a) != 0:
            a.pop(-1)
t =''
m = len(a)
for j in range(m):
    t += a[j]
print(t)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
a = list(map(int,input().split())
s = 0
t = 0
for i in range(N):
    s += a[i]
    t += (a[i])**2
a = math.floor(s/N)
if (s/N) - a > 0.5:
    a += 1
ans = N*a**2 - 2*s*a + t
print(ans)

Fixed submission:
import math
N = int(input())
a = list(map(int,input().split()))
s = 0
t = 0
for i in range(N):
    s += a[i]
    t += (a[i])**2
a = math.floor(s/N)
if (s/N) - a > 0.5:
    a += 1
ans = N*a**2 - 2*s*a + t
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s)
for i in range(n-1):
    a = s[i:i+2]
    if i != n-2:
        b = s[i:i+3]
    if a[0] == a[1]:
        print(i+1,i+2)
        break
    if b[0] == b[2] or b[1] == b[2]:
        print(i+1,i+3)
        break
    if i == n-2:
        print(-1,-1)

Fixed submission:
s = input()
n = len(s)
for i in range(n-1):
    if s[i] == s[i+1]:
        print(i+1,i+2)
        break
    if i != n-2:
        if s[i] == s[i+2] or s[i+1] == s[i+2]:
            print(i+1,i+3)
            break
    if i == n-2:
        print(-1,-1)

Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s)
for i in range(n-1):
    a = s[i:i+2]
    if i != n-2:
        b = s[i:i+3]
    if a[0] == a[1]:
        print(i+1,i+3)
        break
    if b[0] == b[2] or b[1] == b[2]:
        print(i+1,i+3)
        break
    if i = n-2:
        print(-1,-1)
      

Fixed submission:
s = input()
n = len(s)
for i in range(n-1):
    if s[i] == s[i+1]:
        print(i+1,i+2)
        break
    if i != n-2:
        if s[i] == s[i+2] or s[i+1] == s[i+2]:
            print(i+1,i+3)
            break
    if i == n-2:
        print(-1,-1)

Buggy python submission (verdict: Time Limit Exceeded):
s = str(input())
p = -1
q = -1
m = 0
n = 2
N = len(s)
while ((p+1)**2 + (q+1)**2) == 0:
    t = s[m:n]
    r = 0
    for i in range(len(t)):
        d = list(t).count(t[i])
        if r < d:
            r = d
    if r > (len(t)) /2:
        p = m + 1
        q = n 
    if (m-N+2)**2 + (n-N)**2 == 0:
        break
    if n != N:
        n += 1
    else:
        m += 1
        n = m + 2
   
print(p, q)

Fixed submission:
s = input()
n = len(s)
for i in range(n-1):
    if s[i] == s[i+1]:
        print(i+1,i+2)
        break
    if i != n-2:
        if s[i] == s[i+2] or s[i+1] == s[i+2]:
            print(i+1,i+3)
            break
    if i == n-2:
        print(-1,-1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = 2
z = 0

for i in range(n-2):
    def factorization(n):
        arr = []
        temp = n
        for i in range(2, int(-(-n**0.5//1))+1):
            if temp%i==0:
                cnt=0
                while temp%i==0:
                    cnt+=1
                    temp //= i
                arr.append([i, cnt])

        if temp!=1:
            arr.append([temp, 1])

        if arr==[]:
            arr.append([m, 1])

        return arr

    x = 0
    y = 1

    r = factorization(m)
    l = len(r)

    for i in range(l):
        y = y * (r[x][1]+1)
        x+=1


    m+=1
    z = z + y

print(z+1)


Fixed submission:
s = input()
l = len(s)
x = s[l-1]
if x == "s":
    print(s + "es")
else:
    print(s + "s")

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = 2
z = 0

for i in range(n-2):
    def factorization(n):
        arr = []
        temp = n
        for i in range(2, int(-(-n**0.5//1))+1):
            if temp%i==0:
                cnt=0
                while temp%i==0:
                    cnt+=1
                    temp //= i
                arr.append([i, cnt])

        if temp!=1:
            arr.append([temp, 1])

        if arr==[]:
            arr.append([m, 1])

        return arr

    x = 0
    y = 1

    r = factorization(m)
    l = len(r)

    for i in range(l):
        y = y * (r[x][1]+1)
        x+=1


    m+=1
    z = z + y

print(z+1)

Fixed submission:
s = input()
l = len(s)
x = s[l-1]
if x == "s":
    print(s + "es")
else:
    print(s + "s")
Buggy python submission (verdict: Runtime Error):
if b >= 0 and d >= 0 and a <= 0 and c <= 0:
    e = b*d
    f = a*c
    if e > f:
        print(e)
    else:
        print(f)
else:
    e = abs(a)
    f = abs(b)
    g = abs(c)
    h = abs(d)
    l = [e,f,g,h]
    l.sort()
    print(-1*l[0]*l[1])

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

if b >= 0 and d >= 0 and a <= 0 and c <= 0:# - + - + = +
    e = b*d
    f = a*c
    if e > f:
        print(e)
    else:
        print(f)
elif a >= 0 and b >= 0 and c >= 0 and d >= 0: #+ + + +
    print(b*d)
elif a <= 0 and b <= 0 and c <= 0 and d <= 0: #- - - - = -
    print(a*c)
elif a >= 0 and b >= 0 and c <= 0 and d <= 0: #+ + - -
    print(a*d)
elif a >= 0 and b >= 0 and c <= 0 and d >= 0: # + + - +
    print(b*d)
elif a <= 0 and b <= 0 and c >= 0 and d >= 0: # - - + +
    print(b*c)
elif a <= 0 and b <= 0 and c <= 0 and d >= 0: # - - - +
    print(a*c)
elif a <= 0 and b >= 0 and c >= 0 and d >= 0: # - + + +
    print(b*d)
elif a <= 0 and b >= 0 and c <= 0 and d <= 0: # - + - -
    print(a*c)
Buggy python submission (verdict: Runtime Error):
import math
i = 0
a = 0
N, D = map(int, input().split())

while(i < N)
    X, Y = map(int, input().split())
    j = math.sqrt(X ** 2 + Y ** 2)
    if j <= D:
        a+=1
    i+=1

print(a)


Fixed submission:
import math
i = 0
a = 0
N, D = map(int, input().split())

while(i < N):
    X, Y = map(int, input().split())
    j = math.sqrt(X ** 2 + Y ** 2)
    if j <= D:
        a+=1
    i+=1

print(a)

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

a = 0
N, D = map(int, input().split())

for (int i = 0; i < N; i++)
    X, Y = map(int, input().split())
    j = math.sqrt(X ** 2 + Y ** 2)
    if j <= D:
        a+=1

print(a)


Fixed submission:
import math
i = 0
a = 0
N, D = map(int, input().split())

while(i < N):
    X, Y = map(int, input().split())
    j = math.sqrt(X ** 2 + Y ** 2)
    if j <= D:
        a+=1
    i+=1

print(a)

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

int a;
N, D = map(int, input().split())

for(int i = 0; i < N; i++)
  X, Y = map(int, input().split())
  j = math.sqrt(X**2+Y**2)
  if j <= D:
    a++

pinrt(a)

Fixed submission:
import math
i = 0
a = 0
N, D = map(int, input().split())

while(i < N):
    X, Y = map(int, input().split())
    j = math.sqrt(X ** 2 + Y ** 2)
    if j <= D:
        a+=1
    i+=1

print(a)
Buggy python submission (verdict: Runtime Error):
n = list(input())

if n % 9 == 0:
    print('YES')
else:
    print('No')


Fixed submission:
N = int(input())

if N % 9 == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
l_list = list(map(int,input().split()))
l_list.sort()
count = 0
for i in range(0, n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            a = list[i]
            b = list[j]
            c = list[k]
            if a == b or b == c or c == b:
                continue
            if a + b > c:
                count += 1
            else:
                break
print(count)


Fixed submission:
n = int(input())
l_list = list(map(int,input().split()))
l_list.sort()
count = 0
for i in range(0, n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            a = l_list[i]
            b = l_list[j]
            c = l_list[k]
            if a == b or b == c or c == b:
                continue
            if a + b > c:
                count += 1
            else:
                break
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = input().split()

print(a * b)

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

print(a*b)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = list(map(int,input().split()))

ans = 1

for i in range(n):
    ans *= a[i]

if ans > 10 ** 18:
    ans = -1

print(ans)


Fixed submission:
n = int(input())
a = 1
s = list(map(int, input().split()))
if 0 in s:
    print(0)
    exit()
for i in s:
    a*=i
    if a>10**18:
        print(-1)
        exit()
else:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = list(map(int,input().split()))

ans = 1

for i in range(n):
    ans *= a[i]

if ans > 10 ** 18:
    ans = -1

print(ans)


Fixed submission:
n = int(input())
a = 1
s = list(map(int, input().split()))
if 0 in s:
    print(0)
    exit()
for i in s:
    a*=i
    if a>10**18:
        print(-1)
        exit()
else:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = list(map(int,input().split()))

ans = 1

for i in range(n):
    ans *= a[i]

if ans > 10**18:
    print('-1')
else:
    print(ans)


Fixed submission:
n = int(input())
a = 1
s = list(map(int, input().split()))
if 0 in s:
    print(0)
    exit()
for i in s:
    a*=i
    if a>10**18:
        print(-1)
        exit()
else:
    print(a)
Buggy python submission (verdict: Runtime Error):
S = input(str())
W = input(str())

if S > W:
    print('safe')

elif S < W:
    print('unsafe')

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

if w >= s:
    print("unsafe")
else:
    print("safe")

Buggy python submission (verdict: Runtime Error):
python3 make.py abc 999 --num 6

S, W = [int(x) for x in input().split()]

if S > W:
  print('safe')
else:
  print('unsafe')

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

if w >= s:
    print("unsafe")
else:
    print("safe")

Buggy python submission (verdict: Runtime Error):
S = input(str())
W = input(str())

if S > W:
    print('safe')

elif S < W:
    print('unsafe')


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

if w >= s:
    print("unsafe")
else:
    print("safe")
Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  
  int R;
 
  cout << R * π << endl;　
  
}


Fixed submission:
import math

pi = math.pi

R = int(input())

print(2 * R * pi)

Buggy python submission (verdict: Runtime Error):
R = input(str())

print R * π

Fixed submission:
import math

pi = math.pi

R = int(input())

print(2 * R * pi)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,input().split())

print(mak(0,c-(a-b)))


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

print(max(0,c-(a-b)))

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,input().split())

print(max(o,c-(a-b)))


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

print(max(0,c-(a-b)))
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print(max(a*c,a*d,b*c,b*d))

Fixed submission:
x=int(input())
if x==0:
  x=1
else:
  x=0
print(x)
Buggy python submission (verdict: Runtime Error):
a,b,c,d=int(input().split())
print(max(a*c,a*d,b*c,b*d)

Fixed submission:
a,b,c,d=map(int,input().split())
print(max(a*c,a*d,b*c,b*d))
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
A.sort()
ans=1
for i in range(N):
    ans=ans*A[i]
if ans>pow(10,18):
    ans='-1'
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A.sort()
if A[0]!=0:
    ans=1
    for i in range(N):
        ans=ans*A[i]
        if ans>pow(10,18):
            ans='-1'
            break
else:
    ans=0
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
ans=1
for i in range(N):
    ans=ans*A[i]
if ans>pow(10,18):
    ans='-1'
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A.sort()
if A[0]!=0:
    ans=1
    for i in range(N):
        ans=ans*A[i]
        if ans>pow(10,18):
            ans='-1'
            break
else:
    ans=0
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
ans=1
for i in range(N):
    ans=ans*A[i]
if ans>pow(10,18):
    ans='-1'
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A.sort()
if A[0]!=0:
    ans=1
    for i in range(N):
        ans=ans*A[i]
        if ans>pow(10,18):
            ans='-1'
            break
else:
    ans=0
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
ans=1
for i in A:
    ans*=i
if ans>pow(10,18):
    print(-1)
else:
    print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A.sort()
if A[0]!=0:
    ans=1
    for i in range(N):
        ans=ans*A[i]
        if ans>pow(10,18):
            ans='-1'
            break
else:
    ans=0
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B=input().split()
A=int(A)
B=int(B*100)
print(A*B//100)

Fixed submission:
A,B=input().split()
A=int(A)
B=round(100*float(B))
print(A*B//100)

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
B=100*B
print(A*B//2)

Fixed submission:
A,B=input().split()
A=int(A)
B=round(100*float(B))
print(A*B//100)
Buggy python submission (verdict: Runtime Error):
N=int(input())
c=c%10
if c==2 or c==4 or c==5 or c==7 or c==9:
  print('hon')
elif c==0 or c==1 or c==6 or c==8:
    print('pon')
else:
  print('bon')
    

Fixed submission:
N=int(input())
c=N%10
if c==2 or c==4 or c==5 or c==7 or c==9:
  print('hon')
elif c==0 or c==1 or c==6 or c==8:
    print('pon')
else:
  print('bon')
Buggy python submission (verdict: Runtime Error):
import math
X=int(input())
u=100
y=0
while u>=0:
  u=math.floor(u*1.01)
  y+=1
print(y)


Fixed submission:
import math
X=int(input())
u=100
y=0
while u<X:
  u=math.floor(u*1.01)
  y+=1
print(y)

Buggy python submission (verdict: Runtime Error):
X=int(input())
u=100
y=0
while u>=0:
  u=int(u*1.01)
  y+=1
print(y)

Fixed submission:
import math
X=int(input())
u=100
y=0
while u<X:
  u=math.floor(u*1.01)
  y+=1
print(y)
Buggy python submission (verdict: Runtime Error):
N=int(input())
for i in range(N):
  S[i+1]=str(input())
print(len(set(S)))

Fixed submission:
N=int(input())
S=[]
for i in range(N):
  S.append(str(input()))
print(len(set(S)))
Buggy python submission (verdict: Runtime Error):
X,Y,Z=map(int(input().split()))
print(Z,X,Y)

Fixed submission:
X,Y,Z=map(int,input().split())
print(Z,X,Y)
Buggy python submission (verdict: Runtime Error):
N=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(N[int(input()-1)])

Fixed submission:
N=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(N[int(input())-1])
Buggy python submission (verdict: Runtime Error):
S=input()
if s="AAA" or s="BBB":
  print("No")
else:print("Yes")


Fixed submission:
S=input()
if S=="AAA" or S=="BBB":
  print("No")
else:print("Yes")

Buggy python submission (verdict: Runtime Error):
S=input()
if s="aaa" or s="bbb":
  print("No")
else:print("Yes")

Fixed submission:
S=input()
if S=="AAA" or S=="BBB":
  print("No")
else:print("Yes")
Buggy python submission (verdict: Runtime Error):
N,R=int(input().split())
c=0
if N>=10:
  c=R
else:
  c=R+100*(10-c)
print(c)

Fixed submission:
N,R=map(int,input().split())
c=0
if N>=10:
  c=R
else:
  c=R+100*(10-N)
print(c)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
g='APPROVED'
for i in A:
    if i%2 == 0:
        if i%3 != 0 and i%5 != 0:
            g='DENIED'
            break
print(g)

Fixed submission:
A=list(map(int,input().split()))
B=len(set(A))
if B==2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
g='APPROVED'
for i in range(N):
    if A[i]%2 == 0:
        if A[i]%3 != 0 and A[i]%5 != 0:
            g='DENIED'
            break
print(g)

Fixed submission:
A=list(map(int,input().split()))
B=len(set(A))
if B==2:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
A=map(list(int,input().split()))
B=len(set(A))
if B==2:
    print('Yes')
else:
    print('No')

Fixed submission:
A=list(map(int,input().split()))
B=len(set(A))
if B==2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
s,t=input().split()
a,b=map(int,input(),split()
u=input()
if u==s:
  a-=1
else:
  b-=1
print(a,b)


Fixed submission:
S,T=input().split()
A,B=map(int,input().split())
U=input()
if S==U:
    A-=1
else:
    B-=1
print(A,B)

Buggy python submission (verdict: Runtime Error):
s,t=str(input(),split())
a,b=int(input(),split())
u=str(input())
if u==s:
  a-=1
else:
  b-=1
print(a,b)

Fixed submission:
S,T=input().split()
A,B=map(int,input().split())
U=input()
if S==U:
    A-=1
else:
    B-=1
print(A,B)