Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s =input()
k = int(input())

t = 0
u = s[0]

for i in range(len(s)):
	t +=1
	u = s[i]
	if s[i] !="1":
		break
if t<k+1:
	print(u)
else:
	print(1

Fixed submission:
s =input()
k = int(input())

t = 0
u = s[0]

for i in range(len(s)):
	t +=1
	u = s[i]
	if s[i] !="1":
		break
if t<k+1:
	print(u)
else:
	print(1)

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

t = 0
u = s[0]

for i in range(len(s)):
	t +=1
	u = s[i]
	if s[i] !="1":
		break
if t<k+1:
	print(u)
else:
	print(1

Fixed submission:
s =input()
k = int(input())

t = 0
u = s[0]

for i in range(len(s)):
	t +=1
	u = s[i]
	if s[i] !="1":
		break
if t<k+1:
	print(u)
else:
	print(1)
Buggy python submission (verdict: Runtime Error):
n = int(input())

for i in range(n//7+1):
	if n%4==0:
		print("Yes")
		break
	n -=7
else:
	print("No")


Fixed submission:
N, K = map(int,input().split())

if N%K==0:
   print(0)
else:
   print(1)

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

if N%K=0:
   print(0)
else:
   print(1)

Fixed submission:
N, K = map(int,input().split())

if N%K==0:
   print(0)
else:
   print(1)
Buggy python submission (verdict: Runtime Error):
R = int(raw_input())

if R <1200:
	print('ABC')
elif 1200<=R<2800:
	print('ARC')
else :
	print('AGC')

Fixed submission:
R = int(input())

if R <1200:
	print('ABC')

elif R<2800:
	print('ARC')

else :
	print('AGC')
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()

for i in range(len(S)):
	if T==S
		print("Yes")
		break
	S = S[-1]+ S[:-1]
else:
	print("No")


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

for i in range(len(S)):
	if T==S:
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")

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

for i in range(len(S)):
	if T==S
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")

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

for i in range(len(S)):
	if T==S:
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")

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

for i in range(len(S)):
	if S==T
		print("Yes")
		break
	S = S[-1]+ S[:-1]
else:
	print("No")

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

for i in range(len(S)):
	if T==S:
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")

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

for i in range(len(S)):
	s = S[-1]
	S'= S[0:-1]
	if S==T
		print("Yes")
		break
	S = s + S'
else:
	print("No")

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

for i in range(len(S)):
	if T==S:
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")

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

for i in range(len(S)):
	s = S[len(S)]
	S'= S[0:-1]
	if S==T
		print("Yes")
		break
	S = s + S'
else:
	print("No")
		

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

for i in range(len(S)):
	if T==S:
		print("Yes")
		break
	S = S[-1]+ S[0:-1]
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int,input().split()))
A = sorted(A)
x = A[-1]-A[0]
print(x)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
a = sorted(a)
print(a[-1]-a[0])

Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

Buggy python submission (verdict: Runtime Error):
n = int(input())
S = list(map(int, input().split()))
S = sorted(S)
print(a[-1] - a[0])


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

Buggy python submission (verdict: Runtime Error):
n = int(input())
S = list(map(int, input().split()))
a = sorted(S)
print(a[-1] - a[0])


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

a=soretd(S)
print(max(a)-min(a))

Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
a.sort()
print(a[-1] - a[0])


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0:
  print(N)

else:
  print(2 ＊ N)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0: 
         print(N)
else:
         print(2 ＊ N)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0:
  print (N)
else:
  print (2 ＊ N)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0:
  print(N)
else:
  print(2 ＊ N)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0:
  print(N)
else:
  print(2N)


Fixed submission:
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

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

if N%2==0:
  print(N)
else:
  print(2＊N)

Fixed submission:
n = int(input())

if n%2==0:
    print(n)

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



Fixed submission:
n = int(input())
S = list(map(int, input().split()))
S = sorted(S)
print(S[-1] - S[0])

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

a=soretd(S)
print(a[-1]-a[1])


Fixed submission:
n = int(input())
S = list(map(int, input().split()))
S = sorted(S)
print(S[-1] - S[0])

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

a=soretd(S)
print(max(a)-min(a))


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

ans =0

for i in range(leg(s)):
 if s[i] =="+":
   ans += 1
 else:
  ans -=1
print(ans)



Fixed submission:
S = input()

ans = 0
for i in range(len(S)):
    if S[i]=="+":
        ans += 1
    else:
        ans -= 1
        
print(ans)

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

if a='+' b='+' c='+' d='+':
	print('4')
elif a='+' b='+' c='+' d='-':
	print('2')
elif a='+' b='+' c='-' d='+':
	print('2')
elif a='+' b='+' c='-' d='-':
	print('0')
elif a='+' b='-' c='+' d='+':
	print('2')
elif a='+' b='-' c='+' d='-':
	print('0')
elif a='+' b='-' c='-' d='+':
	print('0')
elif a='+' b='-' c='-' d='-':
	print('-2')
elif a='-' b='+' c='+' d='+':
	print('2')
elif a='-' b='+' c='+' d='-':
	print('0')
elif a='-' b='+' c='-' d='+':
	print('0')	
elif a='-' b='+' c='-' d='-':
	print('-2')
elif a='-' b='-' c='-' d='+':
	print('-2')
elif a='-' b='-' c='+' d='-':
	print('-2')
elif a='-' b='-' c='-' d='+':
	print('-2')
else a='-' b='-' c='-' d='-':
	print('-4')




Fixed submission:
S = input()

ans = 0
for i in range(len(S)):
    if S[i]=="+":
        ans += 1
    else:
        ans -= 1
        
print(ans)

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

if a='+' b='+' c='+' d='+':
	print('4')
elif a='+' b='+' c='+' d='-':
	print('2')
elif a='+' b='+' c='-' d='+':
	print('2')
elif a='+' b='+' c='-' d='-':
	print('0')
elif a='+' b='-' c='+' d='+':
	print('2')
elif a='+' b='-' c='+' d='-':
	print('0')
elif a='+' b='-' c='-' d='+':
	print('0')
elif a='+' b='-' c='-' d='-':
	print('-2')
elif a='-' b='+' c='+' d='+':
	print('2')
elif a='-' b='+' c='+' d='-':
	print('0')
elif a='-' b='+' c='-' d='+':
	print('0')	
elif a='-' b='+' c='-' d='-':
	print('-2')
elif a='-' b='-' c='-' d='+':
	print('-2')
elif a='-' b='-' c='+' d='-':
	print('-2')
elif a='-' b='-' c='-' d='+':
	print('-2')
else a='-' b='-' c='-' d='-':
	print('-4')




Fixed submission:
S = input()

ans = 0
for i in range(len(S)):
    if S[i]=="+":
        ans += 1
    else:
        ans -= 1
        
print(ans)

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

if a='+' b='+' c='+' d='+':
	print('4')
elif a='+' b='+' c='+' d='-':
	print('2')
elif a='+' b='+' c='-' d='+':
	print('2')
elif a='+' b='+' c='-' d='-':
	print('0')
elif a='+' b='-' c='+' d='+':
	print('2')
elif a='+' b='-' c='+' d='-':
	print('0')
elif a='+' b='-' c='-' d='+':
	print('0')
elif a='+' b='-' c='-' d='-':
	print('-2')
elif a='-' b='+' c='+' d='+':
	print('2')
elif a='-' b='+' c='+' d='-':
	print('0')
elif a='-' b='+' c='-' d='+':
	print('0')	
elif a='-' b='+' c='-' d='-':
	print('-2')
elif a='-' b='-' c='-' d='+':
	print('-2')
elif a='-' b='-' c='+' d='-'
	print('-2')
elif a='-' b='-' c='-' d='+'
	print('-2')
else a='-' b='-' c='-' d='-'
	print('-4')




Fixed submission:
S = input()

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

if A<9 AND B<9:
	print('Yay!')
else:
	print(':(')

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

if A<9 and B<9:
	print('Yay!')
else:
	print(':(')
Buggy python submission (verdict: Runtime Error):
a, b =map(int,input().split())

if a < b-1:
print(a)

else:
print(a-1)


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

if a<b+1:
     print (a)
else:
     print (a-1)

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

if a<b-1:
print(a)

else:
print(a-1)


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

if a<b+1:
     print (a)
else:
     print (a-1)

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

if a<b-1:
print(a)

else:
print(a-1)

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

if a<b+1:
     print (a)
else:
     print (a-1)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []
for i in range(n):
    a.append(input())

for i in range(n):
    a.append(a[i])


x = 0

for i in range(n):
    for j in range(n):
        for k in range(j+1):
            if a[i+j][k]==a[i+k][j]:
                continue
            else:
                break
        else:
            continue
        break
    else:
        x += 1

print(n*x)

 

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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0
import collections
s = collections.Counter(s)

y,z = zip(*s.most_common())

for i in range(len(z)):
    x += (z[i]*(z[i]-1))//2
print(x)

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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0
import collections
s = collections.Counter(s)


for i in range(len(s)):
    x += (s[i][1]*(z[i][1]-1))//2
print(x)


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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0
import collections
s = collections.Counter(s)

y,z = zip(*s.most_common())

for i in range(len(z)):
    x += (z[i]*(z[i]-1))//2
print(x)

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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0

s = collections.Counter(s)


for i in range(len(s)):
    x += (s[i][1]*(z[i][1]-1))//2
print(x)


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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0
import collections
s = collections.Counter(s)

y,z = zip(*s.most_common())

for i in range(len(z)):
    x += (z[i]*(z[i]-1))//2
print(x)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))

s = []

for i in range(n):
    s.append(sum(a[:i+1]))
s.append(0)

x = 0

for i in range(n):
    for j in range(n-i):
        if s[j]==s[j+i+1]:
            x += 1
print(x)

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

s = []
p = 0

for i in range(n):
    p+=a[i]
    s.append(p)
s.append(0)

x = 0
import collections
s = collections.Counter(s)

y,z = zip(*s.most_common())

for i in range(len(z)):
    x += (z[i]*(z[i]-1))//2
print(x)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = []
for i in range(N):
    S.append(input())

def check(S, A, B):
    for i in range(N):
        for j in range(i+1, N):
            if S[i][j] != S[j][i]:
                return 0
    else return 1

cnt = 0
for i in range(N):
    cnt += check(S[i:] + S[:i], 0, i)
print(cnt * N)


Fixed submission:
N = int(input())
S = []
for i in range(N):
    S.append(input())

def check(S, A, B):
    for i in range(N):
        for j in range(i+1, N):
            if S[i][j] != S[j][i]:
                return 0
    return 1

cnt = 0
for i in range(N):
    cnt += check(S[i:] + S[:i], 0, 0)
print(cnt * N)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []
for i in range(n):
    a.append(input())
for i in range(n):
    a[i].extend(a[i])
for i in range(n):
    a.append(a[i])


x = 0

for i in range(n):
    for j in range(n):
        for k in range(j+1):
            if a[i+j][k]==a[i+k][j]:
                continue
            else:
                break
        else:
            continue
        break
    else:
        x += 1

print(n*x)

 

Fixed submission:
N = int(input())
S = []
for i in range(N):
    S.append(input())

def check(S, A, B):
    for i in range(N):
        for j in range(i+1, N):
            if S[i][j] != S[j][i]:
                return 0
    return 1

cnt = 0
for i in range(N):
    cnt += check(S[i:] + S[:i], 0, 0)
print(cnt * N)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
    a.append(list(input()))

for i in range(n):
    a.append(a[i])


x = 0

for i in range(n):
    for j in range(n):
        for k in range(j+1):
            if a[i+j][k]==a[i+k][j]:
                continue
            else:
                break
        else:
            continue
        break
    else:
        x += 1

print(n*x)

 

Fixed submission:
N = int(input())
S = []
for i in range(N):
    S.append(input())

def check(S, A, B):
    for i in range(N):
        for j in range(i+1, N):
            if S[i][j] != S[j][i]:
                return 0
    return 1

cnt = 0
for i in range(N):
    cnt += check(S[i:] + S[:i], 0, 0)
print(cnt * N)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
    a.append(list(input()))
for i in range(n):
    a[i].extend(a[i])
for i in range(n):
    a.append(a[i])


x = 0

for i in range(n):
    for j in range(n):
        for k in range(j+1):
            if a[i+j][k]==a[i+k][j]:
                continue
            else:
                break
        else:
            continue
        break
    else:
        x += 1

print(n*x)

 

Fixed submission:
N = int(input())
S = []
for i in range(N):
    S.append(input())

def check(S, A, B):
    for i in range(N):
        for j in range(i+1, N):
            if S[i][j] != S[j][i]:
                return 0
    return 1

cnt = 0
for i in range(N):
    cnt += check(S[i:] + S[:i], 0, 0)
print(cnt * N)
Buggy python submission (verdict: Runtime Error):
n = [int(input()) for i in range(1,5)]

x = min(n[1], n[2])+ min(n[3], n[4])

print(x)


Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

Buggy python submission (verdict: Runtime Error):
n = [int,input() for i in range(1,5)]

x = min(n[0], n[1])+ min(n[2], n[3])

print(x)


Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

Buggy python submission (verdict: Runtime Error):
n = [int,input() for i in range(1,5)]

x = min(n[1], n[2])+ min(n[3], n[4])

print(x)

Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

Buggy python submission (verdict: Runtime Error):
l = (int(input()) for i in range(1, 5))
print(min(l[0], l[1]) + min(l[2], l[3]))


Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

Buggy python submission (verdict: Runtime Error):
l = [int(input()) for i in range(1, 6)]
print(min(l[0], l[1]) + min(l[2], l[3]))


Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

Buggy python submission (verdict: Runtime Error):
l = [int(input()) for i in range(1, 4)]
print(min(l[0], l[1]) + min(l[2], l[3]))


Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))

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

x = min(a,b) + min(c,d)

print(x)

Fixed submission:
l = [int(input()) for i in range(1, 5)]
print(min(l[0], l[1]) + min(l[2], l[3]))
Buggy python submission (verdict: Runtime Error):
5
30 44
26
18
81
18
6

Fixed submission:
N = int(input())
D,X = map(int,input().split())

S = X

for i in range(N):
	a = int(input())
	S += (D-1)//a+1
print(S)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())

if a*b % 2 == 0:
     print (Even)
else:
     print (Odd)


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

if a*b%2 == 0:
     print ('Even')
else:
     print ('Odd')

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

if a*b%2 == 0:
     print (Even)
else:
     print (Odd)


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

if a*b%2 == 0:
     print ('Even')
else:
     print ('Odd')

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

if a*b%2 == 0
     print (Even)
else:
     print (Odd)

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

if a*b%2 == 0:
     print ('Even')
else:
     print ('Odd')
Buggy python submission (verdict: Runtime Error):
import collections

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


a = collections.Counter(a)

a = a.most_common()
if k<len(a):
	x = 0
	for i in range(k,len(a)):
		x += a[i][1]

	print(x)
else:
	print(0)


Fixed submission:
import collections

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


a = collections.Counter(a)

a = a.most_common()
if k<len(a):
	x = 0
	for i in range(k,len(a)):
		x += a[i][1]

	print(x)
else:
	print(0)
Buggy python submission (verdict: Runtime Error):
a = [int(input()) for i in range(1,4) ]

if a[1]==a[2]:
     print(a[3])
elif a[1]==a[3]:
     print(a[2])
else:
     print(a[1])

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

if a==b:
     print(c)
elif a==c:
     print(b)
else:
     print(a)
Buggy python submission (verdict: Runtime Error):
N,A = map(int,input().split())

M = N*N-A

print(M)


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

print(N**2-A)

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

print(N**2-A)

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

print(N**2-A)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = ""
for i in range(len(s),2):
     ans += s[i]
print(ans)


Fixed submission:
s = input()

ans = ""
for i in range(len(s)):
	if i % 2 == 0:
		ans += s[i]
print(ans)

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

ans = ""

for i in range(0,len(s),2)
	ans += s[i]
print(ans)


Fixed submission:
s = input()

ans = ""
for i in range(len(s)):
	if i % 2 == 0:
		ans += s[i]
print(ans)

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

for i in S:
	if i%2>0:
		continue
	print('i')

Fixed submission:
s = input()

ans = ""
for i in range(len(s)):
	if i % 2 == 0:
		ans += s[i]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))

s = []

for i in range(n):
	s.append(a[i])
	s.reverse()
s = map(str,s)
print(' '.join(s))


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
q = a[-1]

s = []

for i in range(n):
	s.append(0)

if n%2==1:
	for i in range(n//2+1):
		s[i]=a[-1-2*i]
	for i in range(n//2):
		s[n//2+1+i]=a[2*i+1]
else:
	for i in range(n//2):
		s[i]=a[-1-2*i]
	for i in range(n//2):
		s[n//2+i]=a[2*i]
s = map(str,s)
print(" ".join(s))
Buggy python submission (verdict: Time Limit Exceeded):
nb = int(input())
l = []
for i in range(nb):
  el = input()
  if el not in l:
    l.append(el)
print(len(l))

Fixed submission:
n = int(input())
l = []
for i in range(n):
  l.append(input())
l.sort()
avant = ""
compte =0
for i in range(n):
  if l[i]!=avant:
    compte+=1
    avant=l[i]
print(compte)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
boss = input().split(" ")
for i in range(1,N+1):
  print(boss.count(str(i)))
 	

Fixed submission:
N = int(input())
l = [0]*N
boss = input().split(" ")
for i in range(N-1):
  l[int(boss[i])-1]+=1
for j in range(N):
  print(l[j])
Buggy python submission (verdict: Time Limit Exceeded):
K = int(input())
def pgcd(x,y):
  while y>0:
    x,y=y,x%y
  return x
s = 0
for a in range(1,K+1):
  for b in range(1,K+1):
    for c in range(1,K+1):
      s+=pgcd(pgcd(a,b),c)
print(s)

Fixed submission:
from math import*
K=int(input())
N=0
k=K*K
d1=[0]*int(k)
i=0
j=0
for b in range(K):
    for c in range(K):
        d1[i]=gcd((c+1),(b+1))
        i+=1
for a in range(K):
    for x in d1:
        N+=gcd(x,(a+1))
print(N)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=input()
compte=0
r=[]
g=[]
b=[]
for i in range(n):
    if s[i]=="R":
        r.append(i)
    elif s[i]=="G":
        g.append(i)
    elif s[i]=="B":
        b.append(i)
 
for i in range(1,n-1):
    if n%2==0:
        if i<n//2:
            for j in range(1,i+1):
                if s[i]!=s[i-j] and s[i]!=s[i+j] and s[i+j]!=s[i-j]:
                    compte+=1
        else:
            for j in range(1,n-i):
                if s[i]!=s[i-j] and s[i]!=s[i+j] and s[i+j]!=s[i-j]:
                    compte+=1
    else:
            if i<(n-1)//2:
                for j in range(1,i+1):
                    if s[i]!=s[i-j] and s[i]!=s[i+j] and s[i+j]!=s[i-j]:
                        compte+=1
            elif i==(n-1)//2:
                for j in range(1,n-i):
                    if s[i]!=s[i-j] and s[i]!=s[i+j] and s[i+j]!=s[i-j]:
                        compte+=1
            elif i>(n-1)//2:
                for j in range(1,n-i):
                    if s[i]!=s[i-j] and s[i]!=s[i+j] and s[i+j]!=s[i-j]:
                        compte+=1
 
print(len(r)*len(g)*len(b)-count)

Fixed submission:
N = int(input())
S = input()
if N>3 :
  total = S.count("R")*S.count("G")*S.count("B")
  for i in range(0,N-2):
    for j in range(i+1,N-1):
      if 2*j-i<N:
        if S[i]!=S[j] and S[j]!=S[2*j-i] and S[2*j-i]!=S[i]:
          total-=1
  print(total)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())

print(a*b)


Fixed submission:
a=input()
b=a.split()

print(int(b[0])*int(b[1]))
Buggy python submission (verdict: Runtime Error):
word = input()
a,b = 0

for i in word:
    if i == "A":
        a=a+1
    elif i == "B":
        b=b+1

if a==0 or b==0:
    print("No")
else:
    print("Yes")


Fixed submission:
word = input()

if word[0] == word[1] and word[1] == word[2] and word[0] == word[2]:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
pages=int(input())
papers=round(pages/2 + pages%2)

if pages%2=0:
    print(papers)
else:
    print(pages/2 + pages%2 - 1)


Fixed submission:
pages=int(input())
papers=pages/2
res=int(papers)
if pages%2==0:
    print(res)
else:
    print(res+1)