Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n,t=map(int,input().split())
cost_list=[]
for i in range(n):
  cost,time=map(int,input().split())
  if time<=t:
    cost_list+=[cost]
if cost_list!=[]:
  print(min(cost_list))
else:
  print(TLE)

Fixed submission:
n,t=map(int,input().split())
cost_list=[]
for i in range(n):
  cost,time=map(int,input().split())
  if time<=t:
    cost_list+=[cost]
if cost_list!=[]:
  print(min(cost_list))
else:
  print("TLE")

Buggy python submission (verdict: Runtime Error):
n,t=map(int,input().split())
cost_list=[]
for i in range(n):
  cost,time=map(int,input().split())
  if time<=t:
    cost_list+=cost
if cost_list=![]:
  print(min(cost_list))
else:
  print(TLE)

Fixed submission:
n,t=map(int,input().split())
cost_list=[]
for i in range(n):
  cost,time=map(int,input().split())
  if time<=t:
    cost_list+=[cost]
if cost_list!=[]:
  print(min(cost_list))
else:
  print("TLE")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(max(a,b,c)*9+a+b+C)

Fixed submission:
a,b,c=map(int,input().split())
print(max(a,b,c)*9+a+b+c)
Buggy python submission (verdict: Runtime Error):
print("Yes" if (eval(input().replace(" ",*)))%2 else "No")

Fixed submission:
print("Yes" if eval(input().replace(" ","*"))%2 else "No")

Buggy python submission (verdict: Runtime Error):
print("Yes" if eval(input().replace(" ",*))%2 else "No")

Fixed submission:
print("Yes" if eval(input().replace(" ","*"))%2 else "No")
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
X=list(map(int,input().split()))
ans=[]
for i in range(n-k+1):
  ans.append(X[i+k-1]-X[i]+min(abs(X[i+k+1]),abs(X[i])))
print(min(ans))

Fixed submission:
n,k=map(int,input().split())
X=list(map(int,input().split()))
ans=[]
for i in range(n-k+1):
  ans.append(X[i+k-1]-X[i]+min(abs(X[i+k-1]),abs(X[i])))
print(min(ans))
Buggy python submission (verdict: Runtime Error):
n=int(input())
ans="No"
while n>=0
  if n%4==0:
    ans="Yes"
    break
  else:
    n-=7
print(ans)

Fixed submission:
n=int(input())
ans="No"
while n>=0:
  if n%4==0:
    ans="Yes"
    break
  else:
    n-=7
print(ans)
Buggy python submission (verdict: Runtime Error):
r=int(input())
print("ABC" if r<1200 else "AGC" if r<2800)

Fixed submission:
r=int(input())
print("ABC" if r<1200 else "ARC" if r<2800 else "AGC")
Buggy python submission (verdict: Runtime Error):
*a=map(int,input().split())
print(max(a)-min(a))

Fixed submission:
a=list(map(int,input().split()))
print(max(a)-min(a))

Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
print(max(a)-min(a))

Fixed submission:
a=list(map(int,input().split()))
print(max(a)-min(a))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=b-a
print(n(n+1)//2-b)

Fixed submission:
a,b=map(int,input().split())
n=b-a
print(n*(n+1)//2-b)
Buggy python submission (verdict: Runtime Error):
n,x=map(input().split())
M=[int(input()) for i in range(n)]
print(n+(x-sum(M))//min(M))

Fixed submission:
n,x=map(int,input().split())
M=[int(input()) for i in range(n)]
print(n+(x-sum(M))//min(M))
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
s=max(a,b,c)*3-(a+b+c)
print(s//2 if s%2==0 else (s+3)//2)

Fixed submission:
print("Yes" if len(set(input()))==3 else "No")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
A=[0]+list(map(int,input().split()))+[0]
for i in range(n):
  B=A[:i+1]+A[i+2:]
  print(sum(abs(B[j]-B[j+1]) for j in range(n)))

Fixed submission:
n=int(input())
A=[0]+list(map(int,input().split()))+[0]
S=sum(abs(A[j]-A[j+1]) for j in range(n+1))
for i in range(n):
  if (A[i+1]-A[i])*(A[i+2]-A[i+1])>=0:
    print(S)
  else:
    print(S-abs(A[i+1]-A[i])-abs(A[i+2]-A[i+1])+abs(A[i+2]-A[i]))
Buggy python submission (verdict: Runtime Error):
n=int(input())
blue=[input() for i in range(n)]
m=int(input())
red=[input() for i in range(m)]
print(max([blue.count(blue(i))-red.count(blue(i)) for i in range(n)]),0)

Fixed submission:
n=int(input())
blue=[input() for i in range(n)]
m=int(input())
red=[input() for i in range(m)]
print(max(max([blue.count(blue[i])-red.count(blue[i]) for i in range(n)]),0))
Buggy python submission (verdict: Runtime Error):
a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[3])

Fixed submission:
a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[2])
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
if n>=2 and m>=2:
  print((n-2)*(m-2))
elif n==1 ans m>=2:
  print(m-2)
elif m==1 ans n>=2:
  print(n-2)
else:
  print(1)

Fixed submission:
n,m=map(int,input().split())
if n>=2 and m>=2:
  print((n-2)*(m-2))
elif n==1 and m>=2:
  print(m-2)
elif m==1 and n>=2:
  print(n-2)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
x=int(input()replace(" ",""))
if int((x**.5))**2==x:
  print("Yes")
else:
  print("No")


Fixed submission:
x=int(input().replace(" ",""))
if int(x**.5)**2==x:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
x=int(input()replace(" ",""))
if int((x**.5))**2=x:
  print("Yes")
else:
  print("No")

Fixed submission:
x=int(input().replace(" ",""))
if int(x**.5)**2==x:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n=input()
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))


Fixed submission:
s=input()
print(s[:3]+"8"+s[4:])
Buggy python submission (verdict: Runtime Error):
n=input()
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))


Fixed submission:
n=int(input())
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))

Buggy python submission (verdict: Runtime Error):
n=input
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))

Fixed submission:
n=int(input())
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))

Buggy python submission (verdict: Runtime Error):
n=input
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))

Fixed submission:
n=int(input())
l=[int(input()) for i in range(n)]
s=set(l)
print(len(s))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
s=input()
print("Yes" if s.count("-")==1 and s.index("-")==a else "No)

Fixed submission:
a,b=map(int,input().split())
s=input()
print("Yes" if s.count("-")==1 and s.index("-")==a else "No")
Buggy python submission (verdict: Runtime Error):
n,a,b=map(int,input().split())
print(sum([i for i in range(1,n+1) if a<=sum(map(int,str(i)))<=b]))

Fixed submission:
a,b,c,d=map(int,input().split())
print("Left" if a+b>c+d else "Right" if a+b<c+d else "Balanced")
Buggy python submission (verdict: Runtime Error):
S=input()
l=len(S)
if l%2==1:
    m=S[l//2]
    c=1
    for i in range l//2:
        if S[l//2-i-1]==m and S[l//2+i+1]==m:
            c+=2
        else:
            break
    ans=c+(l-c)//2
else:
    m1=S[l//2-1]
    m2=S[l//2]
    c=0
    if m1==m2:
        c=2
        for i in range l//2-1:
        if S[l//2-i-2]==m1 and S[l//2+i+1]==m1:
            c+=2
        else:
            break
    ans=c+(l-c)//2
print(ans)

Fixed submission:
S=input()
l=len(S)
if l%2==1:
    m=S[l//2]
    c=1
    for i in range(l//2):
        if S[l//2-i-1]==m and S[l//2+i+1]==m:
            c+=2
        else:
            break
    ans=c+(l-c)//2
else:
    m1=S[l//2-1]
    m2=S[l//2]
    c=0
    if m1==m2:
        c=2
        for i in range(l//2-1):
            if S[l//2-i-2]==m1 and S[l//2+i+1]==m1:
                c+=2
            else:
                break
    ans=c+(l-c)//2
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
f=sum(map(int,n))
print("No" if n%f else "Yes")

Fixed submission:
n=int(input())
f=sum(map(int,str(n)))
print("No" if n%f else "Yes")
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input())
print((100*n+1800*m)*2**m)

Fixed submission:
n,m=map(int,input().split())
print((100*n+1800*m)*2**m)
Buggy python submission (verdict: Runtime Error):
N=int(input())
X=0
for i in range(N):
  l,n=map(int,input().split())
  x+=l-n+1
print(X)

Fixed submission:
N=int(input())
X=0
for i in range(N):
  l,n=map(int,input().split())
  X+=n-l+1
print(X)
Buggy python submission (verdict: Runtime Error):
X,t=mao(int,input().split())
print(max(X-t,0))

Fixed submission:
X,t=map(int,input().split())
print(max(X-t,0))
Buggy python submission (verdict: Runtime Error):
s=input()
for i in range(ord("a"),ord("z")+1):
  if chr(i) in s:
    print(chr(i))
    break
else:
  print("None)

Fixed submission:
s=input()
for i in range(ord("a"),ord("z")+1):
  if chr(i) not in s:
    print(chr(i))
    break
else:
  print("None")
Buggy python submission (verdict: Runtime Error):
from functools import reduce
from fractions import gcd
def lcms(a,b):
  return a*b//gcd(a,b)
def lcmm(l):
  return reduce(lcm,l)
n=int(input())
l=[int(input()) for i in range(n)]
print(lcmm(l))

Fixed submission:
from functools import reduce
from fractions import gcd
def lcm(a,b):
  return a*b//gcd(a,b)
def lcmm(l):
  return reduce(lcm,l)
n=int(input())
l=[int(input()) for i in range(n)]
print(lcmm(l))
Buggy python submission (verdict: Runtime Error):
a=input()
print(a[0]+str(len([a]-2))+a[-1])

Fixed submission:
a=input()
print(a[0]+str(len(a)-2)+a[-1])
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
A=[input().split() for _ in range(m)]
ans="IMPOSSIBLE"
for i in range(m):
  if A[i][0]=="1":
    if [A[i][1],str(n)] in A:
      ans="POSSIBLE"
      break
print(ans)

Fixed submission:
n,m=map(int,input().split())
A=set()
B=set()
for i in range(m):
  a,b=input().split()
  if a=="1":
    A.add(b)
  if b==str(n):
    B.add(a)
print("POSSIBLE" if A&B else "IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
A=[input().split() for _ in range(m)]
ans="IMPOSSIBLE"
for i in range(m):
  if A[i][0]=="1":
    if [A[i][1],str(n)] in A:
      ans="POSSIBLE"
print(ans)

Fixed submission:
n,m=map(int,input().split())
A=set()
B=set()
for i in range(m):
  a,b=input().split()
  if a=="1":
    A.add(b)
  if b==str(n):
    B.add(a)
print("POSSIBLE" if A&B else "IMPOSSIBLE")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
A=list(map(int,input().split()))
ans=[]
for i in A:
  ans.append(i)
  ans=ans[::-1]
print(*ans)

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
print(*A[::-2],end=" ")
print(*A[n%2::2])
Buggy python submission (verdict: Runtime Error):
n=int(input())
A=list(int(input()) for i in range(n))
a=0
for x in range(n):
  a=A[i]
  if a==2:
    print(x)
    break
else:
  print(-1)

Fixed submission:
n=int(input())
A=list(int(input()) for i in range(n))
a=0
for x in range(n):
  a=A[a]-1
  if a==1:
    print(x+1)
    break
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
n=int(input())
A=list(int(input()) for i in range(n))
a=0
for x in range(n):
  a=a[i]
  if a==2:
    print(x)
    break

Fixed submission:
n=int(input())
A=list(int(input()) for i in range(n))
a=0
for x in range(n):
  a=A[a]-1
  if a==1:
    print(x+1)
    break
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
x,y=int(map,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
print("Yes" if x in a and y in a or x in b and y in b or x==2 and y==2 else "No")

Fixed submission:
x,y=map(int,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
print("Yes" if x in a and y in a or x in b and y in b or x==2 and y==2 else "No")

Buggy python submission (verdict: Runtime Error):
x,y=int(map,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
print("Yes" if x in a and y in a or x in b and y in b or x==2 and y==2 else "No)

Fixed submission:
x,y=map(int,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
print("Yes" if x in a and y in a or x in b and y in b or x==2 and y==2 else "No")
Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
print("YES" a[-1]==b[0] and b[-1]==c[0] else "NO")

Fixed submission:
a,b,c=input().split()
print("YES" if a[-1]==b[0] and b[-1]==c[0] else "NO")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print("GRATER" if a>b else "LESS" if a<b else "EQUAL")

Fixed submission:
a,b=[list(input()) for i in range(2)]
if len(a)>len(b):
  print("GREATER")
elif len(a)<len(b):
  print("LESS")
elif a>b:
  print("GREATER")
elif a<b:
  print("LESS")
else:
  print("EQUAL")
Buggy python submission (verdict: Runtime Error):
print("ABC" if int(input)<1200 else "ARC")

Fixed submission:
print("ABC" if int(input())<1200 else "ARC")
Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
print(sum(x+y+z==s for x in range(k+1) for y in range(k+1) for z in range(k+1)))

Fixed submission:
k,s=map(int,input().split())
print(sum(0<=s-y-z<=k for y in range(k+1) for z in range(k+1)))
Buggy python submission (verdict: Runtime Error):
s=input()
l=len(s)
if s[0]==s[-1]:
    if l%2=1:
        print("First")
    else:
        print("Second")
else:
    if l%2=0:
        print("First")
    else:
        print("Second")

Fixed submission:
s=input()
l=len(s)
if s[0]==s[-1]:
    if l%2==0:
        print("First")
    else:
        print("Second")
else:
    if l%2==1:
        print("First")
    else:
        print("Second")
Buggy python submission (verdict: Runtime Error):
a,b,h=map(int,input().split())
print((a+b)*h//2)

Fixed submission:
a=int(input())
b=int(input())
h=int(input())
print((a+b)*h//2)
Buggy python submission (verdict: Runtime Error):
a=list(input())
b=list(input())
c=list(input())
turn="a"
while True:
  if turn=="a":
    turn=a.pop()
    if not a:
      print("A")
      break
  elif turn=="b"
    turn=b.pop()
    if not b:
      print("B")
      break
  else:
    turn=c.pop()
    if not c:
      print("C")
      break

Fixed submission:
S={c:list(input()) for c in "abc"}
s="a"
while S[s]:s=S[s].pop(0)
print(s.upper())
Buggy python submission (verdict: Runtime Error):
h,w,n=map(int,input().split())
D=dict()
for i in range(n):
    a,b=map(int,input().split())
    for p in range(-1,2):
        for q in range(-1,2):
            aa=a+p
            bb=b+q
            if 2<=aa<=h-1 and 2<=bb<=w-1:
                aabb=str(aa)+str(bb)
                if aabb in D:
                    D[aabb]+=1
                else:
                    D[aabb]=1
ans=[0]*10
V=list(D.values())
for v in V:
    ans[v]+=1
ans[0]=(h-2)*(w-2)-sum(ans)
for i in range(10):
    print(ans[i])

Fixed submission:
h,w,n=map(int,input().split())
D=dict()
for i in range(n):
    a,b=map(int,input().split())
    for p in range(-1,2):
        for q in range(-1,2):
            aa=a+p
            bb=b+q
            if 2<=aa<=h-1 and 2<=bb<=w-1:
                aabb=str(aa)+"_"+str(bb)
                if aabb in D:
                    D[aabb]+=1
                else:
                    D[aabb]=1
ans=[0]*10
V=list(D.values())
for v in V:
    ans[v]+=1
ans[0]=(h-2)*(w-2)-sum(ans)
for i in range(10):
    print(ans[i])
Buggy python submission (verdict: Runtime Error):
s=list(input())
ans=""
for i in range(len(s)):
  if s[i-1]==B:
    ans=ans[:-1]
  else:
    ans+=s[i-1]

Fixed submission:
s=input()
ans=""
for i in range(len(s)):
  if s[i]=="B":
    ans=ans[:-1]
  else:
    ans+=s[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if x>y:
    swap(x,y)

if y-x>1:
    print("Alice")
else:
    print("Brown")

Fixed submission:
x,y = map(int,input().split())
if x>y:
    x,y = y,x

if y-x>1:
    print("Alice")
else:
    print("Brown")

Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if x>y:
    swap(x,y)

if y-x>1:
    print("Alice")
elif:
    print("Brown")

Fixed submission:
x,y = map(int,input().split())
if x>y:
    x,y = y,x

if y-x>1:
    print("Alice")
else:
    print("Brown")

Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
if x>y:
    swap(x.y)

if y-x>1:
    print("Alice")
elif:
    print("Brown")

Fixed submission:
x,y = map(int,input().split())
if x>y:
    x,y = y,x

if y-x>1:
    print("Alice")
else:
    print("Brown")
Buggy python submission (verdict: Runtime Error):
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

count = 0

for x,y in zip(a,b):
  count += min(a[x],b[y])
  if count > k:
    break
    
print(k // count)


Fixed submission:
a = int(input())

print(a + a ** 2 + a ** 3)

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

count = 0

for i in zip(a,b):
  count += min(a[i],b[i])
  if count > k:
    break
    
print(k // count)


Fixed submission:
a = int(input())

print(a + a ** 2 + a ** 3)

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

print(a + a ** 2 + a ** 3)

Fixed submission:
a = int(input())

print(a + a ** 2 + a ** 3)
Buggy python submission (verdict: Runtime Error):
s = str(input())
t = str(input())

count = 0

for i in range s:
  if s[i] != t[i]
  count += 1
  
print(count)

Fixed submission:
s = str(input())
t = str(input())

sl = len(s)

count = 0

for i in range(0,sl):
  if s[i] != t[i]:
      count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
a = str(input())

if str.isupper() == True:
  print("A")
else:
  print("a")



Fixed submission:
a = input()

if a.isupper():
  print("A")
else:
  print("a")
Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().split())

for i in range(x + 1):
  legs = 2 * i + 4 * (x - i)
  
  if legs == y:
    print("Yes")
    break
    
  else:
    print("No")


Fixed submission:
a,b,c,d,e = (int(x) for x in input().split())

if a == 0:
  print(1)
  
elif b == 0:
  print(2)
  
elif c == 0:
  print(3)
  
elif d == 0:
  print(4)
  
else:
  print(5)
Buggy python submission (verdict: Runtime Error):
n = int(input())

sum = 0
i = 0

for i in range(n+1):
  x = int(input())
  sum *= x
  i += 1
  
  if sum > 10 ** 18:
    print(-1)
    break
    
print(sum)


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

print(a * b)
Buggy python submission (verdict: Runtime Error):
s = input()


count = 0
for i in range(len(s)):
  if s[i] == "P" && s[i + 1] == "D":
    count += 1
  elif s[i] == "D":
    count += 1
  elif s[i] == "?" && s[i + 1] == "D":
    count += 1
    
print(count)


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

wake = a * 60 + b
gobed = c * 60 + d

time = gobed - wake

if time > e:
  print(time - e)
elif time == e:
  print(0)
Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s)

sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]

if s == s[::-1] and a == a[::-1] and b == b[::-1]:
  print("Yes")
  
else:
  print("No")


Fixed submission:
s = input()
n = len(s)

sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]

if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
  print("Yes")
  
else:
  print("No")

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

sa = s[:(n-1) // 2]
sb = s[(n + 1) // 2:]

if s == s[::-1] and a == a[::-1] and b == b[::-1]:
  print("Yes")
  
else:
  print("No")

Fixed submission:
s = input()
n = len(s)

sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]

if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
  print("Yes")
  
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = input()

print(n ** 3)

Fixed submission:
n = int(input())

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

res = b // a + 1

if a == b:
  res = 1
  
print(res)


Fixed submission:
s = input()
t = input()
count = 0

for i in range(3):
  if s[i] == t[i]:
    count += 1

print(count)

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


for i in range 3:
  if s[i] == t[i]:
    count += 1
    print(count)

Fixed submission:
s = input()
t = input()
count = 0

for i in range(3):
  if s[i] == t[i]:
    count += 1

print(count)

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

for i in range len(s):
  if s[i] == t[i]:
    count +=
    print(count)
    
  else:
    print(0)

Fixed submission:
s = input()
t = input()
count = 0

for i in range(3):
  if s[i] == t[i]:
    count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
r = input()

if r < 1200:
  print("ABC")
elif 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()

count = 700

for i in range(s):
  if i == "o":
    count += 100
    
print(count)


Fixed submission:
s = input()

count = 700

for i in s:
  if i == "o":
    count += 100
    
print(count)

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

count = 0

for i in range(s):
  if i == "o":
    count +=
    
print(700 + count * 100)


Fixed submission:
s = input()

count = 700

for i in s:
  if i == "o":
    count += 100
    
print(count)

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

c = 700

for i in range(3):
  if i == ○:
    c += 100
print(c)

Fixed submission:
s = input()

count = 700

for i in s:
  if i == "o":
    count += 100
    
print(count)

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

for i in range(s):
  if i == "○":
    count +=
    
print(700 + count * 100)

Fixed submission:
s = input()

count = 700

for i in s:
  if i == "o":
    count += 100
    
print(count)
Buggy python submission (verdict: Runtime Error):
n,x = map(int,input())
m = list(int(input()) for i in range(n))

print((x - sum(m)) // min(m) + n)


Fixed submission:
n,x = map(int,input().split())
m = list(int(input()) for i in range(n))

print((x - sum(m)) // min(m) + n)

Buggy python submission (verdict: Runtime Error):
n,x = map(int,input())
m = list(int(input()) for i in range(n))

print(x - sum(m) // min(m) + n)

Fixed submission:
n,x = map(int,input().split())
m = list(int(input()) for i in range(n))

print((x - sum(m)) // min(m) + n)
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int, input().split())

print(min(a,b) + min(c,d))


Fixed submission:
a,b,c,d = [int(input()) for i in range(4)]

print(min(a,b) + min(c,d))

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

print(map(a,b) + map(c,d))

Fixed submission:
a,b,c,d = [int(input()) for i in range(4)]

print(min(a,b) + min(c,d))

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

if a >= b && c >= d:
  print(a + c)
  
else:
  print(b + d)

Fixed submission:
a,b,c,d = [int(input()) for i in range(4)]

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

c = int(a + b)

import math

if math.sprt(c).isdigit() == True:
  print("Yes")
  
else:
  print("No")




Fixed submission:
import sys
a,b = map(str,input().split())
c = int(a + b)

for i in range(1,400):
    if c == i**2:
        print('Yes')
        sys.exit()
print('No')
Buggy python submission (verdict: Runtime Error):
from collections import deque
from decimal import *
n,m,k = [Decimal(int(e)) for e in input().split()]
As = deque([Decimal(int(e)) for e in input().split()])
Bs = deque([Decimal(int(e)) for e in input().split()])
result = 0
while True:
    if (not As) and (not Bs):
        break
        
    if (not As) and (Bs[0]>k):
        break
    if (not As) and (Bs[0]<=k):
        k = k-Bs.popleft()
        result = result + 1
        continue
        
    if (not Bs) and (As[0]>k):
        break
    if (not Bs) and (As[0]<=k):
        k = k-As.popleft()
        result = result + 1
        continue
    
    
    if As[0]+As[1] <= Bs[0]+Bs[1]:
        min_reduce = As.popleft()
    else:
        min_reduce = Bs.popleft()

    if min_reduce > k:
        break
    else:
        k = k-min_reduce
        result = result + 1
print(result)

Fixed submission:
a = int(input())
print(a+a**2+a**3)