Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A, B, T = [input(), input(), input()]

print( B * int((T + 0.5)/A) )


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

print( B * int((T + 0.5)/A) )

Buggy python submission (verdict: Runtime Error):
print( B * int((T + 0.5)/A) )

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

print( B * int((T + 0.5)/A) )
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
V = [int(x.strip()) for x in input().split()]
C = [int(x.strip()) for x in input().split()]

Z = [0 for i in range(2**N)]

for i in range(1, 2**N):
    select = []
    temp = i
    for n in reversed(range(1, N+1)):
        if temp - 2**(n-1) >= 0:
            temp = temp - 2**(n-1)
            select.append(n-1)
    Z[i] = sum([V[j] for j in select]) - sum([C[j] for j in select])
print(max(Z))

Fixed submission:
N = int(input())
V = [int(x.strip()) for x in input().split()]
C = [int(x.strip()) for x in input().split()]

Z = [V[i] - C[i] for i in range(N)]
print(sum([z for z in Z if z > 0]))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
V = [int(x.strip()) for x in input().split()]
C = [int(x.strip()) for x in input().split()]

X = [0 for i in range(2**N)]
Y = [0 for i in range(2**N)]
Z = [0 for i in range(2**N)]

for i in range(1, 2**N):
    select = []
    temp = i
    for n in reversed(range(1, N+1)):
        if temp - 2**(n-1) >= 0:
            temp = temp - 2**(n-1)
            select.append(n-1)
    for j in select:
        X[i] += V[j]
        Y[i] += C[j]
    Z[i] = X[i] - Y[i]
print(max(Z))

Fixed submission:
N = int(input())
V = [int(x.strip()) for x in input().split()]
C = [int(x.strip()) for x in input().split()]

Z = [V[i] - C[i] for i in range(N)]
print(sum([z for z in Z if z > 0]))

Buggy python submission (verdict: Runtime Error):
X = [0 for i in range(2**N)]
Y = [0 for i in range(2**N)]
Z = [0 for i in range(2**N)]

for i in range(2**N):
    select = []
    if i > 0:
        temp = i
        for n in reversed(range(1, N+1)):
            if temp - 2**(n-1) >= 0:
                temp = temp - 2**(n-1)
                select.append(n-1)
            else:
                pass
        X[i] = sum([V[i] for i in select])
        Y[i] = sum([C[i] for i in select])
        Z[i] = X[i] - Y[i]
print(max(Z))

Fixed submission:
N = int(input())
V = [int(x.strip()) for x in input().split()]
C = [int(x.strip()) for x in input().split()]

Z = [V[i] - C[i] for i in range(N)]
print(sum([z for z in Z if z > 0]))
Buggy python submission (verdict: Runtime Error):
N,R=int(input( ).split( ))
ans=0
if N>=10:
  ans=R
  
else:
  ans=R+100*(10-N)
 
print(ans)


Fixed submission:
N,R=map(int,input().split())
ans=0
if N>=10:
  ans=R
  
else:
  ans=R+100*(10-N)
 
print(ans)

Buggy python submission (verdict: Runtime Error):
N,R=int(input().split())
ans=0
if N>=10:
  ans=R
  
else:
  ans=R+100*(10-N)
 
print(ans)


Fixed submission:
N,R=map(int,input().split())
ans=0
if N>=10:
  ans=R
  
else:
  ans=R+100*(10-N)
 
print(ans)

Buggy python submission (verdict: Runtime Error):
N,R=int(input().split())
ans=0
if N>=10:
  ans=R
  
else:
  ans=R-100*(10-N)
 
print(ans)

Fixed submission:
N,R=map(int,input().split())
ans=0
if N>=10:
  ans=R
  
else:
  ans=R+100*(10-N)
 
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
data=list(map(int,input().split()))

for i in range(N):
    mo2=data[i]%2
    mo6=data[i]%6
    mo10=data[i]%10
    if mo2==0:
        if mo6==0 or mo10==0:
            ans="APPROVED"

        else:
            ans="DENIED"
            break

print(ans)

Fixed submission:
N=int(input())
data=list(map(int,input().split()))
ans="APPROVED"
for i in range(N):
    mo2=data[i]%2
    mo6=data[i]%6
    mo10=data[i]%10
    if mo2==0:
        if mo6==0 or mo10==0:
            ans="APPROVED"

        else:
            ans="DENIED"
            break
    else:
        continue
print(ans)

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

for i in range(N):
    mo2=data[i]%2
    mo6=data[i]%6
    mo10=data[i]%10
    if mo2==0:
        if mo6==0 or mo10==0:
            ans="APPROVED"
            continue
        else:
            ans="DENIED"
            break
    else:
        continue
print(ans)

Fixed submission:
N=int(input())
data=list(map(int,input().split()))
ans="APPROVED"
for i in range(N):
    mo2=data[i]%2
    mo6=data[i]%6
    mo10=data[i]%10
    if mo2==0:
        if mo6==0 or mo10==0:
            ans="APPROVED"

        else:
            ans="DENIED"
            break
    else:
        continue
print(ans)

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

for i in range(N):
    mod2=data[i]%2
    mod6=data[i]%6
    mod10=data[i]%10
    if mod2==0:
        if mod6==0 or mod10==0:
            ans="APPROVED"
            continue
        else:
            ans="DENIED"
            break
    else:
        continue
print(ans)

Fixed submission:
N=int(input())
data=list(map(int,input().split()))
ans="APPROVED"
for i in range(N):
    mo2=data[i]%2
    mo6=data[i]%6
    mo10=data[i]%10
    if mo2==0:
        if mo6==0 or mo10==0:
            ans="APPROVED"

        else:
            ans="DENIED"
            break
    else:
        continue
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
data = list(map(int, input().split()))
ans=1
if N>1:
    for i in range(1,N):
        if data[i]<=data[i-1]:
            ans+=1
print(ans)

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

if N==M:
    print("Yes")

if N!=M:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
data = list(map(int, input().split()))
ans=0
for i in range(0,N):
    a=[]
    a=data[0:i+1]
    if a[i]==min(a):
        ans+=1

print(ans)

Fixed submission:
N=int(input())
data = list(map(int, input().split()))
ans=1
minmin=data[0]
if N==1:
    ans=1
elif N>1:
    minmin=data[0]
    for i in range(1,N):

        if data[i]<=minmin:
            minmin=data[i]
            #if minmin<=data[i]:
            ans+=1
                #continue
        #if minmin<=data[i]:
            #ans+=1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
data = list(map(int, input().split()))
ans=1
if N==1:
    ans=1
elif N>1:
    for i in range(1,N):
        count=0
        for k in range(0,i+1):
            if data[i]<=data[i-k]:
                count+=1
                if count==i+1:
                    ans+=1
                    #print("I=",i)
                    break
            elif data[i]>data[i-k]:
                break


print(ans)

Fixed submission:
N=int(input())
data = list(map(int, input().split()))
ans=1
minmin=data[0]
if N==1:
    ans=1
elif N>1:
    minmin=data[0]
    for i in range(1,N):

        if data[i]<=minmin:
            minmin=data[i]
            #if minmin<=data[i]:
            ans+=1
                #continue
        #if minmin<=data[i]:
            #ans+=1

print(ans)

Buggy python submission (verdict: Runtime Error):
N=int(input())
data = list(map(int, input().split()))
ans=1
if N>1:
    for i in range(1,N+1):
        if data[i]<=data[i-1]:
            ans+=1
print(ans)

Fixed submission:
N=int(input())
data = list(map(int, input().split()))
ans=1
minmin=data[0]
if N==1:
    ans=1
elif N>1:
    minmin=data[0]
    for i in range(1,N):

        if data[i]<=minmin:
            minmin=data[i]
            #if minmin<=data[i]:
            ans+=1
                #continue
        #if minmin<=data[i]:
            #ans+=1

print(ans)
Buggy python submission (verdict: Runtime Error):
H=int(input())
W=int(input())
N=int(input())
 
if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
if H>=W:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)
 
 
print(int(k))

Fixed submission:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
else:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)

k=int(k)
print(k)

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

if W>H :
    k=int(N/W)+1
else
    k=int(H/W)+1


print(k)

Fixed submission:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
else:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)

k=int(k)
print(k)

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

H=input()
W=input()
N=input()

k=W-3*H-math.sqrt((w-3h)**2-(w-h)**2+4N)
k=int(k)+1

print(k)

Fixed submission:
import math

H=int(input())
W=int(input())
N=int(input())

if W>H :
    if N%W==0:
        k=N/W
    else:
        k=math.ceil(N/W)
else:
    if N%H==0:
        k=N/H
    else:
        k=math.ceil(N/H)

k=int(k)
print(k)
Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
bound_limit= N+1
L = list(map(int,input().split()))
sum=0
count=1
for i in range(0,len(L)):
  sum+=L[i]
  if sum<=x:
    count+=1
  else:
    break
print(count)

Fixed submission:
N,X = map(int,input().split())
bound_limit= N+1
L = list(map(int,input().split()))
sum=0
count=1
for i in range(0,len(L)):
  sum+=L[i]
  if sum<=X:
    count+=1
  else:
    break
print(count)

Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
bound_limit= N+1
L = list(map(int,input().split()))
sum=0
count=1
for i in range(len(L)):
  sum+=L[i]
  if sum<=x:
    count+=1
  else:
    break
print(count)

Fixed submission:
N,X = map(int,input().split())
bound_limit= N+1
L = list(map(int,input().split()))
sum=0
count=1
for i in range(0,len(L)):
  sum+=L[i]
  if sum<=X:
    count+=1
  else:
    break
print(count)
Buggy python submission (verdict: Runtime Error):
W,H,x,y= map(int,input().split())
max=W*H/2
if x=W or y=H:
  check=0
else:
  check=1

print(max,check)


Fixed submission:
W,H,x,y = map(int,input().split())
max=W*H/2
xx=W/2
yy=H/2
if xx==x and yy==y:
  check=1
else:
  check=0
  
print(max,check)
Buggy python submission (verdict: Runtime Error):
N=int(input())
s=[x for x in input()]
#print(s)
answers=[]

for i in range(1,N+1):
    sl=s[:i]
    #print(sl)
    sr=s[i:N]

    l=sl.count("W")
    r=sr.count("E")

    ans=l+r
    #print(ans)
    answers.append(ans)
fa=min(a for a in answers)
print(fa)


Fixed submission:
a=list(map(int,input( ).split( )))
b=a[0]+a[1]
c=a[0]-a[1]
d=a[0]*a[1]
e=max(b,c,d)
print (e)

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

Fixed submission:
a=list(map(int,input( ).split( )))
b=a[0]+a[1]
c=a[0]-a[1]
d=a[0]*a[1]
e=max(b,c,d)
print (e)
Buggy python submission (verdict: Runtime Error):
N, a, b = map(int, input().split())

all = a + b

# a = 0
if a == 0:
    print(0)
    exit(0)

if N <= a:
    print(N)
    exit(0)

# a > 0
c = round(N / all)
d = N % all

roundCnt = a * c

if d != 0:
    if d <= a :
        amariCnt = d
    else:
        amariCnt = a

print(roundCnt + amariCnt)


#a = 0 print 0
#a > 0
# N <= a print N
# N > a
#  N/(a+b)=c     が割り切れる  a * c
#  N/(a+b)=c...d が余りが出る  a * c
#    d <= a のとき a * c + d
#    d >  a のとき a * c + a
#


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

all = a + b

# a = 0
if a == 0:
    print(0)
    exit(0)

if N <= a:
    print(N)
    exit(0)

# a > 0
c = math.floor(N / all)
d = N % all

roundCnt = a * c
amariCnt = 0

if d != 0:
    if d <= a :
        amariCnt = d
    else:
        amariCnt = a

print(roundCnt + amariCnt)


#a = 0 print 0
#a > 0
# N <= a print N
# N > a
#  N/(a+b)=c     が割り切れる  a * c
#  N/(a+b)=c...d が余りが出る  a * c
#    d <= a のとき a * c + d
#    d >  a のとき a * c + a
#
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
sum = [0.0] * (A * B)

for i in range(M):
        x, y, c = map(int,  input().split())
        sum[(y-1)*A + (x-1)] -= c

for ia in range(A):
        for ib in range(B):
                sum[ib*A + ia] += a[ia] + b[ib]

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(int(sum[i]))


Fixed submission:
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

sum = []
for i in range(M):
        x, y, c = map(int,  input().split())
        sum.append(a[x-1]  + b[y-1] - c)

a.sort()
b.sort()

sum.append(a[0] + b [0])

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(sum[i])

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
sum = [0.0] * (A * B)

for i in range(M):
        x, y, c = map(int,  input().split())
        sum[(y-1)*A + (x-1)] -= c

for ia in range(A):
        for ib in range(B):
                sum[ib*A + ia] += a[ia] + b[ib]

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(sum[i])


Fixed submission:
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

sum = []
for i in range(M):
        x, y, c = map(int,  input().split())
        sum.append(a[x-1]  + b[y-1] - c)

a.sort()
b.sort()

sum.append(a[0] + b [0])

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(sum[i])

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
sum = [0] * (A * B)

for i in range(M):
        x, y, c = map(int,  input().split())
        sum[(y-1)*A + (x-1)] = -c

for ia in range(A):
        for ib in range(B):
                sum[ib*A + ia] += a[ia] + b[ib]

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(sum[i])

Fixed submission:
# -*- coding: utf-8 -*-
A, B, M = map(int,  input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

sum = []
for i in range(M):
        x, y, c = map(int,  input().split())
        sum.append(a[x-1]  + b[y-1] - c)

a.sort()
b.sort()

sum.append(a[0] + b [0])

sum.sort()

i=0
while sum[i] < 0:
        i+=0
print(sum[i])
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = input().split()
n = input().split()
s2 = input()
 
if s[0] == s2:
  n[0] = n[0] - 1
else:
  n[1] = n[1] - 1
 
print(str(n[0]) +' '+str(n[1]))


Fixed submission:
# -*- coding: utf-8 -*-
s = input().split()
n = list(map(int,input().split()))
s2 = input()

if s[0] == s2:
  n[0] = n[0] - 1
else:
  n[1] = n[1] - 1

print(str(n[0]) +' '+str(n[1]))

Buggy python submission (verdict: Runtime Error):
s = input().split()
n = input().split()
s2 = input()

if s[0] == s2:
  n[0] = n[0] - 1
else:
  n[1] = n[1] - 1

print(str(n[0]) +' '+str(n[1]))


Fixed submission:
# -*- coding: utf-8 -*-
s = input().split()
n = list(map(int,input().split()))
s2 = input()

if s[0] == s2:
  n[0] = n[0] - 1
else:
  n[1] = n[1] - 1

print(str(n[0]) +' '+str(n[1]))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
print(re.sub('[a-z]', 'x', input()))


Fixed submission:
# -*- coding: utf-8 -*-
import re
s = input()
print(re.sub('[a-z]', 'x', s))

Buggy python submission (verdict: Runtime Error):
-*- coding: utf-8 -*-
print(re.sub('[a-z]', 'x', input()))

Fixed submission:
# -*- coding: utf-8 -*-
import re
s = input()
print(re.sub('[a-z]', 'x', s))
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
a = list(map(int,input().split()))

n = a[0]
k = a[1]
p = list(map(int,input().split()))

e = [(pi+1)/2 for pi in p]

ret = []
for i in range(n-(k-1)):
        b = 0.0
        for j in range(k):
                b += e[i+j]
        ret.append(b)

ret.sort()
print(ret[n-k])

Fixed submission:
# -*- coding: utf-8 -*-
a = list(map(int,input().split()))

n = a[0]
k = a[1]
p = list(map(int,input().split()))

e = [(pi+1)/2 for pi in p]

ret2 = []
b = 0.0
for j in range(k):
        b += e[j]
ret2.append(b)

for i in range(n-k):
        ret2.append(ret2[i] - e[i] + e[i+k])

ret=ret2

ret.sort()
print(ret[n-k])
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if a == 1:
    if b ==2:
        print(3)
    else:
        print(2)
elif a == 2:
    if b == 1:
        print(3)
    else:
        print(1)
else:
    if b == 1:
        print(2)
    else:
        print(1)

Fixed submission:
a = int(input())
b = int(input())
if a == 1:
    if b ==2:
        print(3)
    else:
        print(2)
elif a == 2:
    if b == 1:
        print(3)
    else:
        print(1)
else:
    if b == 1:
        print(2)
    else:
        print(1)
Buggy python submission (verdict: Runtime Error):
n , k = map(int , input(),split())
ans = n - k + 1
print(ans)

Fixed submission:
n , k = map(int , input().split())
ans = n - k + 1
print(ans)
Buggy python submission (verdict: Runtime Error):
bingo = []
tmp = input()
bingo.append(tmp.split(' '))
tmp = input()
bingo.append(tmp.split(' '))
tmp = input()
bingo.append(tmp.split(' '))
for i in len(bingo):
    bingo[i] = [int(bingo[i][0]), int(bingo[i][1]), int(bingo[i][2])]

n = input()
data = []
arr = range(int(n))
arr = list(arr)
for count in arr:
    tmp = input()
    data.append(int(tmp))

ans = []
for num in data:
    for i in len(bingo):
        for j in [0, 1, 2]:
            if bingo[i][j] is num:
                ans.append([i, j])

# 1 2 3
# 4 5 6
# 7 8 9

# 6 15 12 15 15 24 18
# more 3

# 11 12 13
# 21 22 23
# 31 32 33

if [0, 0] in ans and [0, 1] in ans and [0, 2] in ans:
    print('Yes')
    exit(0)

if [1, 0] in ans and [1, 1] in ans and [1, 2] in ans:
    print('Yes')
    exit(0)

if [2, 0] in ans and [2, 1] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 0] in ans and [1, 0] in ans and [2, 0] in ans:
    print('Yes')
    exit(0)

if [0, 1] in ans and [1, 1] in ans and [2, 1] in ans:
    print('Yes')
    exit(0)

if [0, 2] in ans and [1, 2] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 0] in ans and [1, 1] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 2] in ans and [1, 1] in ans and [2, 0] in ans:
    print('Yes')
    exit(0)

print('No')


Fixed submission:
bingo = []
tmp = input()
bingo.append(tmp.split(' '))
tmp = input()
bingo.append(tmp.split(' '))
tmp = input()
bingo.append(tmp.split(' '))
for i in range(len(bingo)):
    bingo[i] = [int(bingo[i][0]), int(bingo[i][1]), int(bingo[i][2])]

n = input()
data = []
arr = range(int(n))
arr = list(arr)
for count in arr:
    tmp = input()
    data.append(int(tmp))

ans = []
for num in data:
    for i in range(len(bingo)):
        for j in [0, 1, 2]:
            if bingo[i][j] is num:
                ans.append([i, j])

# 1 2 3
# 4 5 6
# 7 8 9

# 6 15 12 15 15 24 18
# more 3

# 11 12 13
# 21 22 23
# 31 32 33

if [0, 0] in ans and [0, 1] in ans and [0, 2] in ans:
    print('Yes')
    exit(0)

if [1, 0] in ans and [1, 1] in ans and [1, 2] in ans:
    print('Yes')
    exit(0)

if [2, 0] in ans and [2, 1] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 0] in ans and [1, 0] in ans and [2, 0] in ans:
    print('Yes')
    exit(0)

if [0, 1] in ans and [1, 1] in ans and [2, 1] in ans:
    print('Yes')
    exit(0)

if [0, 2] in ans and [1, 2] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 0] in ans and [1, 1] in ans and [2, 2] in ans:
    print('Yes')
    exit(0)

if [0, 2] in ans and [1, 1] in ans and [2, 0] in ans:
    print('Yes')
    exit(0)

print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1], reverse=True)

a = 0
list2=[]
while a<len(list1) and list1[0][1] == list1[a][1]:
    list2.append(list1[a][0])
    list2.sort()
    a += 1

for a in list2:
    print(a)


Fixed submission:
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1])

a = len(list1)-1
temp = len(list1)-1
list2 = []
while a >= 0 and list1[temp][1] == list1[a][1]:
    list2.append(list1[a][0])
    a -= 1
list2.sort()

for a in list2:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1])
list1.reverse()

a = 0
list2=[]
while a<len(list1) and list1[0][1] == list1[a][1]:
    list2.append(list1[a][0])
    list2.sort()
    a += 1

for a in list2:
    print(a)


Fixed submission:
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1])

a = len(list1)-1
temp = len(list1)-1
list2 = []
while a >= 0 and list1[temp][1] == list1[a][1]:
    list2.append(list1[a][0])
    a -= 1
list2.sort()

for a in list2:
    print(a)

Buggy python submission (verdict: Runtime Error):
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1])
list1.reverse()

a = 0
list2=[]
while list1[0][1] == list1[a][1]:
    list2.append(list1[a][0])
    list2.sort()
    a += 1

print(list2)


Fixed submission:
n = int(input())
b = {}
for i in range(n):
    temp = input()
    if temp not in b:
        b[temp] = 1
    else:
        b[temp] += 1

list1 = sorted(b.items(), key=lambda x: x[1])

a = len(list1)-1
temp = len(list1)-1
list2 = []
while a >= 0 and list1[temp][1] == list1[a][1]:
    list2.append(list1[a][0])
    a -= 1
list2.sort()

for a in list2:
    print(a)
Buggy python submission (verdict: Runtime Error):
N=int(input())
robbot=[input().split() for i in range(N)]
roba=[x[0] for x in robbot]
robb=[x[1] for x in robbot]
robc=list(map(int,roba))
robd=list(map(int,robb))
tas1=[x+y for (x,y) in zip (robc,robd)]
tas2=[x-y for (x,y) in zip (robc,robd)]
del tas2[0]
del tas1[-1]
tas3=[x-y for (x,y) in zip (tas2,tas1)]
tas4=[i for i in tas3 if i>=0 or i-1>=0]
print(len(tas4))
  

Fixed submission:
import math
H=int(input())
W=int(input())
N=int(input())
if H>=W:
    print(str(math.ceil(N/H)))
else:
    print(str(math.ceil(N/W)))

Buggy python submission (verdict: Runtime Error):
N=int(input())
robbot=[input().split() for i in range(N)]
roba=[x[0] for x in robbot]
robb=[x[1] for x in robbot]
robc=list(map(int,roba))
robd=list(map(int,robb))
tas1=[x+y for (x,y) in zip (robc,robd)]
tas2=[x-y for (x,y) in zip (robc,robd)]
del tas2[0]
del tas1[-1]
tas3=[x-y for (x,y) in zip (tas2,tas1)]
tas4=[i for i in tas3 if i>=0]
print(len(tas4)+1)
  


Fixed submission:
import math
H=int(input())
W=int(input())
N=int(input())
if H>=W:
    print(str(math.ceil(N/H)))
else:
    print(str(math.ceil(N/W)))
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
U=T+S
Print(U)


Fixed submission:
S=list(input().split())
print(S[1]+S[0])