Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
for i in range(1,100):
    a=int(raw_input("Enter the height a in meters="))
    b=int(raw_input("Enter the height b in meters="))
    c=int(raw_input("Enter the height c in meters="))
    if b-a==c-b:
        print 'Yes'
        print'Since'+str(b)+ '-' +str(a)+ '=' +str(c)+ '-' +str(b)+ ',this arrangement of poles is beautiful.'
    elif c-b==b-a:
        print 'Yes'
        print'Since'+str(c)+ '-' +str(b)+ '=' +str(b)+ '-' +str(a)+ ',this arrangement of poles is beautiful.'
    else:
        print 'NO'
        print'Since'+str(b)+ '-' +str(a)+ '≠' +str(c)+ '-' +str(b)+ ',this arrangement of poles is not beautiful.'

Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
a=int(input("Enter a number")
b=int(input("Enter b")
c=(int(input("Enter C")
if a-b == b-c || b-a == c-b:
 print ("Beautiful")
else :
 print("No")


Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
for i in range(1,100):
    a=int(input("Enter the height a in meters="))
    b=int(input("Enter the height b in meters="))
    c=int(input("Enter the height c in meters="))
    if(b-a==c-b):
        print("Yes")
        print('Since'+str(b)+ '-' +str(a)+ '=' +str(c)+ '-' +str(b)+ ',this arrangement of poles is beautiful.')
    elif(c-b==b-a):
        print("Yes")
        print('Since'+str(c)+ '-' +str(b)+ '=' +str(b)+ '-' +str(a)+ ',this arrangement of poles is beautiful.')
    else:
        print("NO")
        print('Since'+str(b)+ '-' +str(a)+ '≠' +str(c)+ '-' +str(b)+ ',this arrangement of poles is not beautiful.')


Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

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

if b<a and b<c:
 print("No")
elif b-a==c-b:
 print("Yes")



Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
import math
a, b, c = input().split()
d = math.fabs(b-a)
e = math.fabs(c-b)
if d == e:
 print('YES')
else:
 print('NO')

Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
import math
def beautiful:
     a, b, c = input().split()
     d = math.fabs(b-a)
     e = math.fabs(c-b)
      if  d == e:
            print('YES')
      else:
            print('NO')

beautiful()

Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
import math
def beautiful:
     a,b,c = input().split()
      if fabs(b-a)) == fabs(c-b):
            print('YES')
      else:
            print('NO')

beautiful()

Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
O=[]
E=[]
P=[]
Olength=int(input("Enter the length of odd Characters")
for i in range (o,Olength):
 x=input("ENTER cHARACTERS")
 O.append(x)
Elength=int(input("Enter the length of even Characters")
for i in range (o,Elength):
 x=input("ENTER cHARACTERS")
 E.append(x)
for i in range (o,Olength):
 P.append(O[i])
 P.append(E[i])

for i in range (o, P.length):
 print(P[i])

Fixed submission:
def solve():
    o = input()
    e = input()

    try:
        for i in range(max(len(o), len(e))):
            print(o[i], end='')
            print(e[i], end='')
    except:
        pass


if __name__ == "__main__":
    solve()
Buggy python submission (verdict: Runtime Error):
n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
ans = []
for i in range(n):
    a = list(input())
    a.sort()
    if i == 0:
        ans = a
    else:
        k = 0
        if len(a) >= len(ans):
            while k < len(a):
                if k >= len(ans):
                    break
                if a[k] < ans[k]:
                    del a[k]
                elif a[k] == ans[k]:
                    k += 1
                elif a[k] > ans[k]:
                    del ans[k]
        else:
            while k < len(ans):
                if k >= len(a):
                    del ans[k]
                    k += 1
                if a[k] < ans[k]:
                    del a[k]
                elif a[k] == ans[k]:
                    k += 1
                elif a[k] > ans[k]:
                    del ans[k]

for i in ans:
    print(i, end="")

Fixed submission:
N = int(input())
s_list = []
s_set = []

for i in range(N):
	s_list.append(list(x for x in input()))

for i in s_list:
	s_set.append(set(i))

result_char = {x for x in 'qwertyuiopasdfghjklzxcvbnm'}

for i in range(N-1):
	result_char = (s_set[i] & s_set[i+1] & result_char)

result_char = list(result_char)
result_char.sort()

result = ''
for i in result_char:
	count = min(x.count(i) for x in s_list)
	result += i*count
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
can=0
mayor=0
for i in range(len(s)):
  can=0
  can3=0
  can2=0
  if s[i]=="A":
    posicion=i
    a=len(s[posicion:])
    for i in range(len(s)-posicion):
      posicion2=i+posicion
      #print(s[i])
      if s[i+posicion]=="Z":
        if posicion2==a:
          can+=1
          break
        else:
          for i in range(len(s)-posicion2):   
            #if s[i+posicion2]=="Z":          
             # can+=1
            #else:
            if s[i+posicion2]!="Z":
              can2+=1
              #print("sdasd")
              #print(i+posicion,len(s)-posicion2)
              if i+posicion2==len(s)-1:
                can2=0
            else:
              can3+=1
          can3=can3+can2
        break 
      #elif s[i+posicion]=="Z":
        #can+=1
        #break
      elif i+posicion==len(s)-1 and s[i+posicion]!="Z":
        can=0
      else:
        can+=1
  can=can+can3
  if can>mayor:
    mayor=can
print(mayor)
'''
a=len(s[posicion:])

for i in range(len(s)-posicion):
  posicion2=i+posicion
  #print(s[i])
  if s[i+posicion]=="Z":
    if posicion2==a:
      can+=1
      break
    else:
      for i in range(len(s)-posicion2):   
        if s[i+posicion2]=="Z":          
          can+=1
        else:
          break
    break 
  #elif s[i+posicion]=="Z":
    #can+=1
    #break
  elif i+posicion==len(s)-1 and s[i+posicion]!="Z":
    can=0
  else:
    can+=1
print(can)
'''

Fixed submission:
s = input()

indexA = 0
indexZ = len(s)

for i in range(indexZ):
	if s[i] == "A":
		indexA = i
		break

s = s[::-1]

for i in range(len(s)):
	if s[i] == "Z":
		indexZ = len(s)-i
		break

print(indexZ - indexA)
Buggy python submission (verdict: Runtime Error):
s = raw_input("Please enter your numbers: ")
p= int(s[0]) 
q= int(s[1])
r= int(s[2])
s= int(s[3])
def area(a,b,c, d):
    if a*b > c*d:
        print a*b
    elif c*d > a*b:
        print c*d
    else:
        print a*b
x = area(p,q,r,s)

Fixed submission:
numbers = list(map(lambda x: int(x), input().split(" ")))

sq1 = numbers[0] * numbers[1]
sq2 = numbers[2] * numbers[3]

if sq1 > sq2:
    print(sq1)
else:
    print(sq2)
Buggy python submission (verdict: Runtime Error):
n = raw_input()
S = raw_input()

N = int(n)
x=0 
y = str(x)
for i in range(0,N):
    if S[i] == "I":
        x = x+1 
        y = y + str(x)
    elif S[i]=="D":
        x = x - 1 
        y = y + str(x)
        
print max([int(c) for c in y])


Fixed submission:
n=int(input())
s=input()
x=0
maxx=0
for char in s:
  if char =='I':
    x+=1
  else:
    x-=1
  if maxx<x:
    maxx=x
print (maxx)
Buggy python submission (verdict: Time Limit Exceeded):
k,s = [int(n) for n in input().split()]
ac = 0
for x in range(k+1):
  if s-x <= 2*k:
    for y in range(k+1):
      if s-x-y <= k:
        for z in range(k+1):
          if x+y+z == s:
            ac += 1
print(str(ac))

Fixed submission:
k,s=map(int,input().split())
ans=0
for x in range(k+1):
    for y in range(k+1):
        z=s-x-y
        if 0<=z<=k:
            ans+=1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
k,s = [int(n) for n in input().split()]
ac = 0
for x in range(k+1):
  for y in range(k+1):
    for z in range(k+1):
      if x+y+z == s:
        ac += 1
print(str(ac))

Fixed submission:
k,s=map(int,input().split())
ans=0
for x in range(k+1):
    for y in range(k+1):
        z=s-x-y
        if 0<=z<=k:
            ans+=1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin
n = input().split(' ')
c = 0
K = n[0]
S = n[1]
for i in range(int(K)+1):
    for j in range(int(K)+1):
        for k in range(int(K)+1):
            sum=i+j+k
            if sum is int(S):
                c += 1
                break
                
print(c)

Fixed submission:
k,s=map(int,input().split())
ans=0
for x in range(k+1):
    for y in range(k+1):
        z=s-x-y
        if 0<=z<=k:
            ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):

a=input()
res=0
if a[1]=="+":
    res=int(a[0])+int(a[2])
else:
    res=int(a[0])-int(a[2])
print(res)
    

Fixed submission:
# python
my_input = str(input())
print(str(eval(my_input)))

Buggy python submission (verdict: Runtime Error):
input = input().split(" ")
output = 0;
if input[1] == "+":
    output = input[0] + input[2]
else:
    output = input[0] - input[2]

print(output)


Fixed submission:
# python
my_input = str(input())
print(str(eval(my_input)))

Buggy python submission (verdict: Runtime Error):
input = raw_input().split(" ")
output = 0;
if input[1] == "+":
    output = input[0] + input[2]
else
    output = input[0] - input[2]

print(output)

Fixed submission:
# python
my_input = str(input())
print(str(eval(my_input)))

Buggy python submission (verdict: Runtime Error):
# Python
user_input = input("Input in format A op B")
input_sep = user_input.split()
input_a = input_sep[0]
operator = input_sep[1]
input_b = input_sep[2]

if operator is '+':
    print(int(input_a + input_b))
elif operator is '-':
    print(int(input_a - input_b))

Fixed submission:
# python
my_input = str(input())
print(str(eval(my_input)))

Buggy python submission (verdict: Runtime Error):
 line = input()
 b=line.split()
if b[1]=='+':
      print(int(b[0])+int(b[2]))
else:
      print(int(b[0])-int(b[2]))


Fixed submission:
# python
my_input = str(input())
print(str(eval(my_input)))
Buggy python submission (verdict: Runtime Error):
num_of_pro = raw_input()
problems = raw_input()
num_of_drinks = raw_input()
drinks_lines = []
count = 0
while count < int(num_of_drinks):
count += 1
each_line = raw_input()
drinks_lines.append(each_line)
for each_line in drinks_lines:
problem_num = [int(each_num) for each_num in problems.split()]
problem_num[int(each_line.split()[0]) -1] = int(each_line.split()[1])
print sum(problem_num)

Fixed submission:
#!/usr/bin/env python
num_of_pro = raw_input()
problems = raw_input()
num_of_drinks = raw_input()
drinks_lines = []
count = 0 
while count < int(num_of_drinks):
	count += 1
	each_line = raw_input()
	drinks_lines.append(each_line)
for each_line in drinks_lines:
	problem_num = [int(each_num) for each_num in problems.split()]
	problem_num[int(each_line.split()[0]) -1] = int(each_line.split()[1])
	print sum(problem_num)
Buggy python submission (verdict: Runtime Error):
content = input().split()
abbrev = [letter[0] for letter in content if letter[0].isupper() ]
abbrev = "".join(abbrev)
print(abbrev)

Fixed submission:
str_words = raw_input()
after_split = ''.join([each_str[0] for each_str in str_words.split()])
print(after_split)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int, input().split())
flag=0
for i in range(a, b+1):
    if i%x==0:
        flag=flag+1

print(flag)


Fixed submission:
a, b, x = [int(x) for x in input().split()]
print(b // x - (a - 1) // x)

Buggy python submission (verdict: Runtime Error):
import sys
veces= list()
lines = sys.stdin.readlines()
for linea in lines:
    c = linea.split()
    c = list(map(int,c))
list(c)

rango = range(c[0],c[1]+1)
j = list(rango)
for l in range(len(j)):
  division = j[l]%c[2]
  if division == 0:
    veces.append(division)

print(int(len(veces)))    

Fixed submission:
a, b, x = [int(x) for x in input().split()]
print(b // x - (a - 1) // x)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int,input().split())
c=0
def fun():
     print('1')
     print('2')
for i in range(a,b+1):
     if i%x==0:
          c+=1
print(c)

Fixed submission:
a, b, x = [int(x) for x in input().split()]
print(b // x - (a - 1) // x)
Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
    ios::sync_with_stdio(false);
    cin >> s;
    cout << unique(s.begin(), s.end()) - s.begin() - 1 << endl;
    return 0;
}

Fixed submission:
ls=input().strip()
a=ls[0]
b=0
for i in ls[1:]:
     if i!=a:
          b+=1
          a=i
print(b)
Buggy python submission (verdict: Runtime Error):
a=list(map(int,input().split())
return len(set(a))

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

print(len(s))

Buggy python submission (verdict: Runtime Error):
    #!/usr/bin/env python3
    #
    # FILE: 2138-AtCoDeer_and_Paint_Cans.py
    #
    # @author: Arafat Hasan Jenin <opendoor.arafat[at]gmail[dot]com>
    #
    # LINK: https://abc046.contest.atcoder.jp/tasks/abc046_a?lang=en
    #
    # DATE CREATED: 17-06-18 00:09:52 (+06)
    # LAST MODIFIED: 17-06-18 00:19:32 (+06)
    #
    # VERDICT: Accepted
    #
    # DEVELOPMENT HISTORY:
    # Date         Version     Description
    # --------------------------------------------------------------------
    # 17-06-18     1.0         Deleted code is debugged code.
    #
    #               _/  _/_/_/_/  _/      _/  _/_/_/  _/      _/
    #              _/  _/        _/_/    _/    _/    _/_/    _/
    #             _/  _/_/_/    _/  _/  _/    _/    _/  _/  _/
    #      _/    _/  _/        _/    _/_/    _/    _/    _/_/
    #       _/_/    _/_/_/_/  _/      _/  _/_/_/  _/      _/
    #
    ##############################################################################
     
    print(len(set(map(int, input().split()))))

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

print(len(s))
Buggy python submission (verdict: Runtime Error):
def back_home():
    r=input()
    print(r)
    l = dict()
    for i in r:
        if i in l:
            l[i]=int(l[i])+1
        else:
            l[i]=1
    if (len(l)==1):
        return('NO')
    elif(len(l)==2):
        if (l['S']>0 and l['N']>0):
            return ("yes")
        elif(l['E']>0 and l['W']>0):
            return("yes")
        else:
            return("NO")
    elif(len(l)==3):
        return("NO")
    else:
        return("YES")
        
back_home()

Fixed submission:
def backhome():
	s = input()
	if (('N' in s) and ('S' in s)) and not (('W' in s) or ('E' in s)):
		print("Yes")
	elif (('W' in s) and ('E' in s)) and not (('N' in s) or ('S' in s)):
		print("Yes")
	elif (('W' in s) and ('E' in s)) and (('N' in s) and ('S' in s)):
		print("Yes")
	else:
		print("No")

backhome()
Buggy python submission (verdict: Runtime Error):
s=input()
l=[]
for i in s:
    if i=='0':
        l.append('0')
    elif i=='1':
        l.append('1')
    elif i=='B':
        l.pop()
    
for i in l:
    print(i,end='')

Fixed submission:
s = input()

r = ""
for c in s:
    if c == "B":
        r = r[:-1]
    else:
        r += c
print(r)
Buggy python submission (verdict: Runtime Error):
A=int(input("Enter A:"))
B=int(input("Enter B:"))
C=int(input("Enter C:"))
if((A==5 or B==5 or C==7) and(A==5 or C==5 or B==7) and(B==5 or C==5 or A==7)):
    print("YES")
else:
    print("NO")

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

b = [0]*10

for i in arr:
    b[i-1] += 1

if (b[4]==2 and b[6]==1):
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
A=int(input("Enter A:"))
B=int(input("Enter B:"))
C=int(input("Enter C:"))
if ((A==5 or B==5 or C==7) and(A==5 or C==5 or B==7) and(B==5 or C==5 or A==7)):
   print("Yes")
else:
   print("No")

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

b = [0]*10

for i in arr:
    b[i-1] += 1

if (b[4]==2 and b[6]==1):
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
a1=input()
a2=input()
a3=input()
a=[a1,a2,a3]
a.sort()
flag=0
for i in range(2):
    if a[i]!='5':
        flag=flag+1
if a[2]!='7':
    flag=flag+1
 
if flag==0:
    print("YES")
else:
    print("NO")

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

b = [0]*10

for i in arr:
    b[i-1] += 1

if (b[4]==2 and b[6]==1):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = int(input())
l=[]
for _ in range(0,N):
    s=input()
    l.append(s)
s=""
l.sort()

for i in l:
    s = s+i
print(s)

Fixed submission:
n,l=map(int,input().split())
a=[]
for i in range(n):
	a.append(str(input()))

a.sort()
ans=''
for i in a:
	ans+=i
print(ans)

Buggy python submission (verdict: Runtime Error):
N,L=map(int,input().split())
S = [input() for i in range(N)]
S.sort()
for s in S:
  print(s,end=“”)

Fixed submission:
n,l=map(int,input().split())
a=[]
for i in range(n):
	a.append(str(input()))

a.sort()
ans=''
for i in a:
	ans+=i
print(ans)

Buggy python submission (verdict: Runtime Error):
n,l=map(int, input())
s=[list(input()) for i in range(n)]
s.sort()
for i in s:
    print(i,end="")
print()

Fixed submission:
n,l=map(int,input().split())
a=[]
for i in range(n):
	a.append(str(input()))

a.sort()
ans=''
for i in a:
	ans+=i
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def find(x):
    if parent[x]<0:
        return x
    else:
        parent[x]=find(parent[x])
        return parent[x]

def same(x,y):
    return find(x)==find(y)

def union(x,y):
    root_x=find(x)
    root_y=find(y)
    if root_x==root_y:
        return
    if parent[root_x]>parent[root_y]:
        root_x,root_y=root_y,root_x
    parent[root_x]+=parent[root_y]
    parent[root_y]=root_x

def members(n,x):
    root=find(x)
    return [i for i in range(n) if find(i)==root]

def get_size(x):
    return -parent[find(x)]

def get_root():
    return [i for i, root in enumerate(parent) if root<0]

N,M=map(int,input().split())
parent=[-1 for i in range(N)]
for i in range(M):
    a,b=map(int,input().split())
    a=a-1
    b=b-1
    union(a,b)

poe=[]
for i in range(N):
    if i==find(i):
        poe.append((members(N,i)))

ans=len(poe)-1

print(ans)

Fixed submission:
def find(x):
    if parent[x]<0:
        return x
    else:
        parent[x]=find(parent[x])
        return parent[x]

def same(x,y):
    return find(x)==find(y)

def union(x,y):
    root_x=find(x)
    root_y=find(y)
    if root_x==root_y:
        return
    if parent[root_x]>parent[root_y]:
        root_x,root_y=root_y,root_x
    parent[root_x]+=parent[root_y]
    parent[root_y]=root_x

def members(n,x):
    root=find(x)
    return [i for i in range(n) if find(i)==root]

def get_size(x):
    return -parent[find(x)]

def get_root():
    return [i for i, root in enumerate(parent) if root<0]

N,M=map(int,input().split())
parent=[-1 for i in range(N)]
for i in range(M):
    a,b=map(int,input().split())
    a=a-1
    b=b-1
    union(a,b)

ans=0
for i in parent:
    if i<0:
        ans+=1

print(ans-1)
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
a=len(S)
b=len(T)
m=a-b
A=[]
for i in range(m):
    cnt=b
    for j in range(b):
        if S[i+j]==T[j]:
            cnt-=1
    A.append(cnt)
print(min(A))

Fixed submission:
S=input()
T=input()
a=len(S)
b=len(T)
m=a-b
ans=b
if m!=0:
    for i in range(m):
        cnt=b
        for j in range(b):
            if S[i+j]==T[j]:
                cnt-=1
        ans=min(cnt,ans)
else:
    cnt=b
    for i in range(a):
        if S[i]==T[i]:
            cnt-=1
    ans=min(cnt,ans)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
K=int(input())
if K%2==0:
    print(-1)
else:
    if K%7==0:
        L=9*K//7
    else:
        L=9*K
    i=1
    rest=(10**i)%L
    while True:
        if rest==1:
            print(i)
            exit()
        else:
            rest=(rest*10)%L
            i+=1


Fixed submission:
K=int(input())
if K%2==0:
    print(-1)
else:
    if K%7==0:
        L=9*K//7
    else:
        L=9*K
    rest=10%L
    for i in range(1,L+1):
        if rest==1:
            print(i)
            exit()
        else:
            rest=(rest*10)%L
        if i==L and rest!=1:
            print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
c=input()
ans=[]
for i in range(N+1):
    ans.append(max(c[i:].count('R'),c[:i].count('W')))
print(min(ans))


Fixed submission:
N=int(input())
c=input()
R=c.count('R')
W=0
ans=[R,c.count('W')]
for i in range(N):
    if c[i]=='W':
        W+=1
    else:
        R-=1
    ans.append(max(R,W))
print(min(ans))

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
c=input()
ans=len(c)
for i in range(N+1):
    ans=min(ans,max(c[i:].count('R'),c[:i].count('W')))
print(ans)

Fixed submission:
N=int(input())
c=input()
R=c.count('R')
W=0
ans=[R,c.count('W')]
for i in range(N):
    if c[i]=='W':
        W+=1
    else:
        R-=1
    ans.append(max(R,W))
print(min(ans))
Buggy python submission (verdict: Time Limit Exceeded):
N,K=map(int,input().split())
A=list(map(int,input().split()))
s=[]
for j in range(K-1,N):
    score=1
    for i in range(j-K+1,j+1):
        score*=A[i]
    s.append(score)
    
for i in range(len(s)-1):
    if s[i]<s[i+1]:
        print("Yes")
    else:
        print("No")

Fixed submission:
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(N-K):
    if A[i]<A[i+K]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
cnt=1
for i in range(N):
    cnt*=A[i]
print(-1 if cnt>10**18 else cnt)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A=sorted(A)
cnt=1
for i in range(N):
    cnt*=A[i]
    if cnt>10**18:
        cnt=-1
        break
print(cnt)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
cnt=1
for i in range(N):
    cnt*=A[i]
pritn(cnt)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
A=sorted(A)
cnt=1
for i in range(N):
    cnt*=A[i]
    if cnt>10**18:
        cnt=-1
        break
print(cnt)
Buggy python submission (verdict: Runtime Error):
a,b=input()
a=int(a)
b=float(b)
print(int(a*b))


Fixed submission:
from decimal import Decimal
a,b=input().split()
a=int(a)
b=Decimal(b)
print(int(a*b))