Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
h,w=map(int,input().split())
s=[]
for _ in range(h):
    s.append(list(input()))
l=[[0 for x in range(w+2)] for y in range(h+2)]
r=[[0 for x in range(w+2)] for y in range(h+2)]
u=[[0 for x in range(w+2)] for y in range(h+2)]
d=[[0 for x in range(w+2)] for y in range(h+2)]
#l
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][j-1]==".":
            l[i][j]=l[i][j-1]+1
        else:
            l[i][j]=0
#r
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][w-(j-1)-1]==".":
            r[i][w+1-j]=r[i][w+1-j+1]+1
        else:
            r[i][w+1-j]=0
#u
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][j-1]==".":
            u[i][j]=u[i-1][j]+1
        else:
            u[i][j]=0
#d
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[h-(i-1)-1][j-1]==".":
            d[h+1-i][j]=d[h+1-i+1][j]+1
        else:
            d[h+1-i][j]=0
ans=0
for y in range(1,h+1):
    for x in range(1,w+1):
        sum=r[y][x]+l[y][x]+u[y][x]+d[y][x]-3
        if ans<sum:
            ans=sum
print(ans)


Fixed submission:
h,w=map(int,input().split())
s=[]
for _ in range(h):
    s.append(list(input()))
l=[[0 for x in range(w+2)] for y in range(h+2)]
r=[[0 for x in range(w+2)] for y in range(h+2)]
u=[[0 for x in range(w+2)] for y in range(h+2)]
d=[[0 for x in range(w+2)] for y in range(h+2)]
#l
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][j-1]==".":
            l[i][j]=l[i][j-1]+1
        else:
            l[i][j]=0
#r
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][w-(j-1)-1]==".":
            r[i][w+1-j]=r[i][w+1-j+1]+1
        else:
            r[i][w+1-j]=0
#u
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[i-1][j-1]==".":
            u[i][j]=u[i-1][j]+1
        else:
            u[i][j]=0
#d
for i in range(1,h+1):
    for j in range(1,w+1):
        if s[h-(i-1)-1][j-1]==".":
            d[h+1-i][j]=d[h+1-i+1][j]+1
        else:
            d[h+1-i][j]=0
ans=0
for y in range(1,h+1):
    for x in range(1,w+1):
        sum=r[y][x]+l[y][x]+u[y][x]+d[y][x]-3
        if ans<sum:
            ans=sum
print(ans)
Buggy python submission (verdict: Runtime Error):
n,a,b,c,d=map(int,input().split())
s=input()
if s[:max(c,d)].count("##")>0:
    print("No")
elif c<d:
    print("Yes")
else:
    if s[b-1:d+1].count("...")=0:
        print("No")
    else:
        print("Yes")


Fixed submission:
n,a,b,c,d=map(int,input().split())
s=input()
if s[a-1:max(c,d)].count("##")>0:
    print("No")
elif c<d:
    print("Yes")
else:
    if "..." in s[b-2:d+1]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
s=s.replace("BC","D")
ans=0
x=s.count("AD")
while x>0:
    ans+=x
    s=s.replace("AD","DA")
    x=s.count("AD")
print(ans)


Fixed submission:
s=input()
s=s.replace("BC","D")
n=len(s)
ans=0
cnt=0
for i in range(n-1,-1,-1):
    if s[i]=="B" or s[i]=="C":
        cnt=0
    elif s[i]=="D":
        cnt+=1
    else:
        ans+=cnt
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
ans=0
while s.count("ABC")>0:
    x=s.count("ABC")
    ans+=x
    s=s.replace("ABC","BCA")
print(ans)


Fixed submission:
s=input()
s=s.replace("BC","D")
n=len(s)
ans=0
cnt=0
for i in range(n-1,-1,-1):
    if s[i]=="B" or s[i]=="C":
        cnt=0
    elif s[i]=="D":
        cnt+=1
    else:
        ans+=cnt
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
ans=0
while s.count("ABC")>0:
    x=s.count("ABC")
    ans+=x
    s=s.replace("ABC","BCA")
print(ans)


Fixed submission:
s=input()
s=s.replace("BC","D")
n=len(s)
ans=0
cnt=0
for i in range(n-1,-1,-1):
    if s[i]=="B" or s[i]=="C":
        cnt=0
    elif s[i]=="D":
        cnt+=1
    else:
        ans+=cnt
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,t=map(int,input().split())
T=a
cnt=0
while T<=t:
    ans+=b
    T+=a
print(cnt)


Fixed submission:
a,b,t=map(int,input().split())
T=a
ans=0
while T<t+0.5:
    ans+=b
    T+=a
print(ans)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
list=[a,b,c,d,e]
min=100
for i in range(len(list)):
    if list[i]%10!=0 and list[i]%10<min:
        memo=list[i]
        min=list[i]%10
flag=0
for k in range(len(list)):
    if list[k]==memo and flag==0:
        flag=1
    else:
        while list[k]%10!=0:
            list[k]+=1
print(sum(list))


Fixed submission:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
list=[a,b,c,d,e]
if a%10==0 and b%10==0 and c%10==0 and d%10==0 and e%10==0:
    print(sum(list))
    exit()
min=100
for i in range(len(list)):
    if list[i]%10!=0 and list[i]%10<min:
        memo=list[i]
        min=list[i]%10
flag=0
for k in range(len(list)):
    if list[k]==memo and flag==0:
        flag=1
    else:
        while list[k]%10!=0:
            list[k]+=1
print(sum(list))
Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
for _ in range(q):
    l,r=map(int,input().split())
    x=s[l-1:r]
    v=len(x)
    y=x.replace("AC","")
    w=len(y)
    print((v-w)//2)


Fixed submission:
n,q=map(int,input().split())
s=input()
list=[0]*(n+1)
cnt=0
for i in range(1,n):
    if s[i]=="C" and s[i-1]=="A":
        cnt+=1
        list[i+1]+=cnt
    else:
        list[i+1]+=cnt
for _ in range(q):
    l,r=map(int,input().split())
    print(list[r]-list[l])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=0
for i in range(1,42):
    if (b//2**i)*(2**(i-1))+(b%(2*i-1))-(((a-1)//2**i)*(2**(i-1))+((a-1)%(2*i-1))%2!=0:
        s=s+2**(i-1)
print(s)



Fixed submission:
a,b=map(int,input().split())
a+=1
b+=1
s=0
for i in range(1,42):
    k=b-(b//(2**i))*(2**i)
    if k>=2**(i-1):
        x=(b//(2**i))*(2**(i-1))+(k%(2**(i-1)))
    else:
        x=(b//(2**i))*(2**(i-1))
    j=(a-1)-((a-1)//(2**i))*(2**i)
    if j>=2**(i-1):
        y=((a-1)//(2**i))*(2**(i-1))+(j%(2**(i-1)))
    else:
        y=((a-1)//(2**i))*(2**(i-1))
    if x!=0 and (x-y)%2!=0:
        s+=2**(i-1)
print(s)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=0
for i in range(1,42):
    if (b//2**i)*(2**(i-1))+(b%(2*i-1))-(((a-1)//2**i)*(2**(i-1))+((a-1)%(2*i-1))%2!=0
        s=s+2**(i-1)
print(s)



Fixed submission:
a,b=map(int,input().split())
a+=1
b+=1
s=0
for i in range(1,42):
    k=b-(b//(2**i))*(2**i)
    if k>=2**(i-1):
        x=(b//(2**i))*(2**(i-1))+(k%(2**(i-1)))
    else:
        x=(b//(2**i))*(2**(i-1))
    j=(a-1)-((a-1)//(2**i))*(2**i)
    if j>=2**(i-1):
        y=((a-1)//(2**i))*(2**(i-1))+(j%(2**(i-1)))
    else:
        y=((a-1)//(2**i))*(2**(i-1))
    if x!=0 and (x-y)%2!=0:
        s+=2**(i-1)
print(s)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=0
for i in range(1,42):
    if (b//2**i)*(2**(i-1))+(b%(2*i-1))-(((a-1)//2**i)*(2**(i-1))+((a-1)%(2*i-1))%2!=0
        s+=2**(i-1)
print(s)


Fixed submission:
a,b=map(int,input().split())
a+=1
b+=1
s=0
for i in range(1,42):
    k=b-(b//(2**i))*(2**i)
    if k>=2**(i-1):
        x=(b//(2**i))*(2**(i-1))+(k%(2**(i-1)))
    else:
        x=(b//(2**i))*(2**(i-1))
    j=(a-1)-((a-1)//(2**i))*(2**i)
    if j>=2**(i-1):
        y=((a-1)//(2**i))*(2**(i-1))+(j%(2**(i-1)))
    else:
        y=((a-1)//(2**i))*(2**(i-1))
    if x!=0 and (x-y)%2!=0:
        s+=2**(i-1)
print(s)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
h=list(map(int,input().split()))
ans=0
while any(h)==True:
    flag=0
    for i in range(n-1):
        if h[i]>0:
            h[i]-=1
            flag=1
        else:
            if flag==1:
                ans+=1
                flag=0
        if i==n-2:
            if h[n-1]>0:
                h[n-1]-=1
                ans+=1
            else:
                if flag==1:
                    ans+=1

print(ans)


Fixed submission:
n=int(input())
h=list(map(int,input().split()))
ans=0
if n==1:
    print(h[0])
    exit()
while any(h)==True:
    flag=0
    for i in range(n-1):
        if h[i]>0:
            h[i]-=1
            flag=1
        else:
            if flag==1:
                ans+=1
                flag=0
        if i==n-2:
            if h[n-1]>0:
                h[n-1]-=1
                ans+=1
            else:
                if flag==1:
                    ans+=1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
h=list(map(int,input().split()))
ans=0
while any(h)==True:
    flag=0
    for i in range(n-1):
        if h[i]>0:
            h[i]-=1
            flag=1
        else:
            if flag==1:
                ans+=1
                flag=0
        if i==n-2:
            if h[n-1]>0:
                h[n-1]-=1
                ans+=1
                break
            else:
                if h[i]>-1 and flag==1:
                    ans+=1
                break
print(ans)


Fixed submission:
n=int(input())
h=list(map(int,input().split()))
ans=0
if n==1:
    print(h[0])
    exit()
while any(h)==True:
    flag=0
    for i in range(n-1):
        if h[i]>0:
            h[i]-=1
            flag=1
        else:
            if flag==1:
                ans+=1
                flag=0
        if i==n-2:
            if h[n-1]>0:
                h[n-1]-=1
                ans+=1
            else:
                if flag==1:
                    ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for _ in range(n+1)]
dp[2]=abs(h[1]-h[0])
for i in range(2,n):
    dp[i+1]=999999999
    for x in range(min(k,i)):
        if dp[i+1]>dp[i-x]+abs(h[i]-h[i-1-x]):
            dp[i+1]=dp[i-x]+abs(h[i]-h[i-1-x])
print(dp[n])


Fixed submission:
n=int(input())
h=list(map(int,input().split()))
dp=[0 for _ in range(n+1)]
dp[2]=abs(h[1]-h[0])
for i in range(2,n):
    dp[i+1]=min(dp[i]+abs(h[i]-h[i-1]),dp[i-1]+abs(h[i]-h[i-2]))
print(dp[n])
Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for _ in range(n+1)]
dp[2]=abs(h[1]-h[0])
for i in range(2,n):
    dp[i+1]=999999999
    for x in range(min(k,i)):
        if dp[i+1]>dp[i-x]+abs(h[i]-h[i-1-x]):
            dp[i+1]=dp[i-x]+abs(h[i]-h[i-1-x])
print(dp[n])


Fixed submission:
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for _ in range(n+1)]
dp[2]=abs(h[1]-h[0])
for i in range(2,n):
    dp[i+1]=999999999
    for x in range(min(k,i)):
        if dp[i+1]>dp[i-x]+abs(h[i]-h[i-1-x]):
            dp[i+1]=dp[i-x]+abs(h[i]-h[i-1-x])
print(dp[n])
Buggy python submission (verdict: Time Limit Exceeded):
n,W=map(int,input().split())
wei=[]
val=[]
for _ in range(n):
    x,y=map(int,input().split())
    wei.append(x)
    val.append(y)
dp=[[0 for p in range(W+1)] for q in range(n+1)]
for i in range(n):
    for w in range(W+1):
        if wei[i]<=w:
            dp[i+1][w]=max(dp[i][w-wei[i]]+val[i],dp[i][w])
        else:
            dp[i+1][w]=dp[i][w]
print(dp[n][W])


Fixed submission:
n,W=map(int,input().split())
wei=[]
val=[]
for _ in range(n):
    x,y=map(int,input().split())
    wei.append(x)
    val.append(y)
dp=[[0 for p in range(W+1)] for q in range(n+1)]
for i in range(n):
    for w in range(W+1):
        if wei[i]<=w:
            dp[i+1][w]=max(dp[i][w-wei[i]]+val[i],dp[i][w])
        else:
            dp[i+1][w]=dp[i][w]
print(dp[n][W])
Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
temp=9999
for i in h:
    if temp>abs((t-h[i]*0.006)-a):
        temp=abs((t-h[i]*0.006)-a)
        ans=i+1
print(ans)


Fixed submission:
n=int(input())
t,a=map(int,input().split())
h=list(map(int,input().split()))
temp=9999
for i in range(len(h)):
    if temp>abs((t-h[i]*0.006)-a):
        temp=abs((t-h[i]*0.006)-a)
        ans=i+1
print(ans)
Buggy python submission (verdict: Runtime Error):
n,T=map(int,input().split())
c=[0]*n
t=[0]*n
ans=[]
for i in range(n):
    c[i],t[i]=map(int,input().split())
    if t[i]<=T:
        ans.append(c[i])
print(min(ans))
 


Fixed submission:
n,T=map(int,input().split())
ans=9999
flag=0
for _ in range(n):
    c,t=map(int,input().split())
    if T>=t and c<ans:
        ans=c
        flag=1
if flag==0:
    print("TLE")
else:
    print(ans)
Buggy python submission (verdict: Runtime Error):
n=input()
for i in range(len(n)):
    if n[i]=="1":
        n[i]="9"
    else:
        n[i]="1"
print(n)


Fixed submission:
n=input()
ans=""
for i in range(len(n)):
    if n[i]=="1":
        ans+="9"
    else:
        ans+="1"
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
n,x=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n):
    a[i]=abs(a[i]-x)
a=sorted(a)
ans=a[0]
for k in a:
    ans=math.gcd(ans,k)
print(ans)


Fixed submission:
import fractions
n,x=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n):
    a[i]=abs(a[i]-x)
a=sorted(a)
ans=a[0]
for k in a:
    ans=fractions.gcd(ans,k)
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[]
for x in range(15):
    for y in range(26):
        a.append(x*7+y*4)
if not n in a:
    print("No")
else:
    print("Yes)

Fixed submission:
n=int(input())
a=[]
for x in range(15):
    for y in range(26):
        a.append(x*7+y*4)
if not n in a:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
n=int(input())
if n%11==0 or n%7==0 or n%4==0 or n%11==4 or n%7==4 n%11==7:
    print("Yes")
else:
    print("No")


Fixed submission:
n=int(input())
a=[]
for x in range(15):
    for y in range(26):
        a.append(x*7+y*4)
if not n in a:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
d,n=,map(int,input().split())
print(n*(100**d))

Fixed submission:
d,n=map(int,input().split())
if n==100:
    print((n+1)*(100**d))
else:
    print(n*(100**d))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(a):
    x=0
    while x==0:
        if a[i]%2!=0:
            x=1
        else:
            s+=1
            a[i]/=2
print(s)
         

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(len(a)):
    x=0
    while x==0:
        if a[i]%2!=0:
            x=1
        else:
            s+=1
            a[i]/=2
print(s)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c=(b-c)
s=0
for i in range(1,c+1):
    s+=i
print(s-b)

Fixed submission:
a,b=map(int,input().split())
c=(b-a)
s=0
for i in range(1,c+1):
    s+=i
print(s-b)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
a0=[]
for i in range(n):
    left=s[:i:].count("W")
    right=s[i+1:].count("E")
    a0.append(left+right)
a=sorted(a0)
print(a[0])


Fixed submission:
n=int(input())
s=input()
w=[0]*n
e=[0]*n
for i in range(n):
    if s[i]=="W":
        if i==0:
           w[i]+=1
        else:
            w[i]+=w[i-1]+1
            e[i]+=e[i-1]
    else:
        if i==0:
            e[i]+=1
        else:
            e[i]+=e[i-1]+1
            w[i]+=w[i-1]
min=9999999
for i in range(n):
    if i==0:
        num=e[n-1]-e[i]

    else:
        num=w[i-1]+e[n-1]-e[i]
    if min>num:
        min=num
print(min)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
min=300000
for i in range(n):
    number=s[:i:].count("W")+s[i+1:].count("E")
    if min>number:
        min=number
print(min)


Fixed submission:
n=int(input())
s=input()
w=[0]*n
e=[0]*n
for i in range(n):
    if s[i]=="W":
        if i==0:
           w[i]+=1
        else:
            w[i]+=w[i-1]+1
            e[i]+=e[i-1]
    else:
        if i==0:
            e[i]+=1
        else:
            e[i]+=e[i-1]+1
            w[i]+=w[i-1]
min=9999999
for i in range(n):
    if i==0:
        num=e[n-1]-e[i]

    else:
        num=w[i-1]+e[n-1]-e[i]
    if min>num:
        min=num
print(min)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
min=300000
for i in range(n):
    left=s[:i:].count("W")
    right=s[i+1:].count("E")
    if min>left+right:
        min=left+right
print(min)


Fixed submission:
n=int(input())
s=input()
w=[0]*n
e=[0]*n
for i in range(n):
    if s[i]=="W":
        if i==0:
           w[i]+=1
        else:
            w[i]+=w[i-1]+1
            e[i]+=e[i-1]
    else:
        if i==0:
            e[i]+=1
        else:
            e[i]+=e[i-1]+1
            w[i]+=w[i-1]
min=9999999
for i in range(n):
    if i==0:
        num=e[n-1]-e[i]

    else:
        num=w[i-1]+e[n-1]-e[i]
    if min>num:
        min=num
print(min)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
min=99999999
for i in range(n):
    left=s[:i:].count("W")
    right=s[i+1:].count("E")
    if min>left+right:
        min=left+right
print(min)


Fixed submission:
n=int(input())
s=input()
w=[0]*n
e=[0]*n
for i in range(n):
    if s[i]=="W":
        if i==0:
           w[i]+=1
        else:
            w[i]+=w[i-1]+1
            e[i]+=e[i-1]
    else:
        if i==0:
            e[i]+=1
        else:
            e[i]+=e[i-1]+1
            w[i]+=w[i-1]
min=9999999
for i in range(n):
    if i==0:
        num=e[n-1]-e[i]

    else:
        num=w[i-1]+e[n-1]-e[i]
    if min>num:
        min=num
print(min)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
if b-a+1<=2k:
    for i in range(a,b+1):
        print(i)
else:
    for j in range(k):
        print(a+j)
    for l in range(k):
        print(b-k+1+l)

        

Fixed submission:
a,b,k=map(int,input().split())
if b-a+1<=2*k:
    for i in range(a,b+1):
        print(i)
else:
    for j in range(k):
        print(a+j)
    for l in range(k):
        print(b-k+1+l)
Buggy python submission (verdict: Runtime Error):
n=int(input())
d,x=map(int,input().split())
s=0
for i in range(n):
    w=0
    while d>=w*int(input())+1:
        s+=1
        w+=1
print(s+x)

Fixed submission:
n=int(input())
d,x=map(int,input().split())
s=0
for i in range(n):
    w=0
    a=int(input())
    while d>=w*a+1:
        s+=1
        w+=1
print(s+x)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=[]
for x in range(n):
    s.append(input())
m=int(input())
t=[]
for y in range(m):
    t.append(input())
m=0
for i in range(n):
    v=s[i]
    c=0
    for k in range(i,n):
        if v==s[k]:
            c+=1
    for j in range(m):
        if v==t[j]:
            c-=1
    if c>m:
        m=c
print(m)

Fixed submission:
n=int(input())
s=[]
for x in range(n):
    s.append(input())
m=int(input())
t=[]
for y in range(m):
    t.append(input())
q=0
for i in range(n):
    v=s[i]
    c=0
    for k in range(i,n):
        if v==s[k]:
            c+=1
    for j in range(m):
        if v==t[j]:
            c-=1
    if c>q:
        q=c
print(q)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=0
for i in range(a,b+1):
    x=list(str(i))
    y=[]
    for k in range(len(x)):
        y.append(x[len(x)-i-1])
    z=""
    for j in y:
        z+=j
    if i==int(z):
        s+=1
print(s)
      
        

Fixed submission:
a,b=map(int,input().split())
s=0
for i in range(a,b+1):
    x=list(str(i))
    y=[]
    for k in range(len(x)):
        y.append(x[-1-k])
    z=""
    for j in y:
        z+=j
    if i==int(z):
        s+=1
print(s)
Buggy python submission (verdict: Runtime Error):
n=iny(input())
a=set(list(input().split()))
if len(a)==3:
    print("Three")
else:
    print("Four")


Fixed submission:
n=int(input())
a=set(list(input().split()))
if len(a)==3:
    print("Three")
else:
    print("Four")

Buggy python submission (verdict: Runtime Error):
n=iny(input())
a=set(list(input().split())
if len(a)==3:
    print("Three")
else:
    print("Four")

Fixed submission:
n=int(input())
a=set(list(input().split()))
if len(a)==3:
    print("Three")
else:
    print("Four")
Buggy python submission (verdict: Runtime Error):
a.b=map(int,input().split())
X=str((a+b)*5)
x=int(X[-1])
if x>=5:
    print((a+b)//2+1)
else:
    print((a+b)//2)


Fixed submission:
a,b=map(int,input().split())
X=str((a+b)*5)
x=int(X[-1])
if x>=5:
    print((a+b)//2+1)
else:
    print((a+b)//2)
Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
num=list(map(int,input().split()))
a=[0]*n
for x in num:
    a[x-1]+=1
a=sorted(a)
for i in range(n):
    if a[i]!=0:
        del a[:i]
        break
ans=0
while len(a)>k:
    ans+=a[0]
    a.pop(0)
print(ans)


Fixed submission:
n,k=map(int,input().split())
num=list(map(int,input().split()))
a=[0]*n
for x in num:
    a[x-1]+=1
a=sorted(a)
for i in range(n):
    if a[i]!=0:
        del a[:i]
        break
ans=0
i=0
while len(a)-i>k:
    ans+=a[i]
    i+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
x=input()
f=0
for i in range(len(x)):
    f+=int(x[i])
if x%f==0:
    print("Yes")
else:
    print("No")



Fixed submission:
x=input()
f=0
for i in range(len(x)):
    f+=int(x[i])
if int(x)%f==0:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
x=input()
f=0
for i in len(x):
    f+=int(x[i])
if x%f==0:
    print("Yes")
else:
    print("No")


Fixed submission:
x=input()
f=0
for i in range(len(x)):
    f+=int(x[i])
if int(x)%f==0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x,y=input().split()
a=list(set(x,y))
sorted(a)
if len(a)==1:
    print("=")
else:
    if x==a[0]:
        print("<")
    else:
        print(">")



Fixed submission:
x,y=input().split()
if x==y:
    print("=")
else:
    if x==min(x,y):
        print("<")
    else:
        print(">")
Buggy python submission (verdict: Runtime Error):
s1=list(input())
s2=list(input())
a=[s1,s2]
for x in range3:
    if a[0][x]!=a[1][2-x]:
        print("NO")
        exit()
print("YES")


Fixed submission:
s1=list(input())
s2=list(input())
a=[s1,s2]
for x in range(3):
    if a[0][x]!=a[1][2-x]:
        print("NO")
        exit()
print("YES")
Buggy python submission (verdict: Runtime Error):
n=input()
for i in range(len(n)//2)
    if n[i]!=n[-1-i]:
        print("No")
        exit()
print("Yes")

Fixed submission:
n=input()
for i in range(len(n)//2):
    if n[i]!=n[-1-i]:
        print("No")
        exit()
print("Yes")