Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
import collections

c = collections.Counter(a)
values, counts = zip(*c.most_common())
if counts[-1] == 1:
	k = counts.index(1)
	del counts[k:]


from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

from collections import deque
t = deque()
for i in counts:
    t.append(cmb(i,2))

t = list(t)
ans = sum(t)

for i in a:
	print(ans - c[i] + 1)


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

c = collections.Counter(a)
values, counts = zip(*c.most_common())
counts = list(counts)
if counts[-1] == 1:
	k = counts.index(1)
	del counts[k:]


from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

from collections import deque
t = deque()
for i in counts:
    t.append(cmb(i,2))

t = list(t)
ans = sum(t)

for i in a:
	print(ans - c[i] + 1)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
import collections
#重複のみ
a_rep = {x for x in set(a) if a.count(x)>1}

#全て
a_all = set(a)

#一度だけ
a_once = a_all - a_rep
c = collections.Counter(a)
values, counts = zip(*c.most_common())
if counts[-1] == 1:
	k = counts.index(1)
	del counts[k:]


from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

from collections import deque
t = deque()
for i in counts:
    t.append(cmb(i,2))

t = list(t)
ans = sum(t)

for i in a:
    if i in a_once:
        print(ans)
    else:
        print(ans - c[i] + 1)


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

c = collections.Counter(a)
values, counts = zip(*c.most_common())
counts = list(counts)
if counts[-1] == 1:
	k = counts.index(1)
	del counts[k:]


from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

from collections import deque
t = deque()
for i in counts:
    t.append(cmb(i,2))

t = list(t)
ans = sum(t)

for i in a:
	print(ans - c[i] + 1)
Buggy python submission (verdict: Runtime Error):
a, b, m = map(int, input().split())
a1 = list(map(int, input().split()))
b1 = list(map(int, input().split()))

disc = [list(map(int, input().split())) for i in range(m)]
import numpy as np



from collections import deque
ans = []
ans = deque(ans)

for i in range(m):
    ans.append( a1[disc[i][0]-1] + b1[disc[i][1]-1] - disc[i][2] )
b2 = np.array(b1)
a2 = np.array(a1)
a2 = a2.reshape(a,1)
ans = list(ans)
print(min( min(ans), np.min(a2+b2) ))


Fixed submission:
s = input()


if s == "hi":
  print("Yes")
elif s == "hihi":
  print("Yes")
elif s == "hihihi":
  print("Yes")
elif s == "hihihihi":
  print("Yes")
elif s == "hihihihihi":
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
s = split(s)
if s[0]==s[1]==s[2]:
  print("No")
else:
  print("Yes")

Fixed submission:
s = input()

if s[0]==s[1]==s[2]:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())

if n = m:
  print("Yes")
else:
  print("No")

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

if n == m:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
li = input().split()

if li[0]>=li[1]:
  print(li[1]＊int(li[0]))
else:
  print(li[0]＊int(li[1]))


Fixed submission:
li = input().split()

if li[0]>=li[1]:
  print(li[1] *int(li[0]))
else:
  print(li[0] *int(li[1]))

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

if a>=b:
  print(b＊int(a))
else:
  print(a＊int(b))


Fixed submission:
li = input().split()

if li[0]>=li[1]:
  print(li[1] *int(li[0]))
else:
  print(li[0] *int(li[1]))

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

if a>=b:
  print(b1)
elif a<b:
  print(a1)

Fixed submission:
li = input().split()

if li[0]>=li[1]:
  print(li[1] *int(li[0]))
else:
  print(li[0] *int(li[1]))
Buggy python submission (verdict: Runtime Error):
n = int(input())

count = [0*[10] for i in range(10)]

for i in range(1,n+1):
    first = int(str(i)[0])
    last = int(str(i)[-1])

    if first == 0 or last == 0:
        continue
    else:
        count[first][last] += 1

ans = 0
for first in range(1,10):
    ans += count[first][last] * count[last][first]

print(ans)

Fixed submission:
n = int(input())

count = [[0]*10 for i in range(10)]

for i in range(1,n+1):
    first = int(str(i)[0])
    last = int(str(i)[-1])

    if first == 0 or last == 0:
        continue
    else:
        count[first][last] += 1

ans = 0
for first in range(1,10):
  for last in range(1,10):
    ans += count[first][last] * count[last][first]
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())

if a >= k:
    print(a-k,b)
elif a<k<=a+b:
    print(0,a+b-k)
else:
    print(0,0)

Fixed submission:
s,t = input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s,t = map(input().split())
print(s+t)

Fixed submission:
s,t = input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())

if a >= k:
    print(a-k,b)
elif a<k<=b:
    print(0,a+b-k)
elif:a+b<=k
    print(0,0)

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

if a >= k:
    print(a-k,b)
elif a<k<=a+b:
    print(0,a+b-k)
else:
    print(0,0)
Buggy python submission (verdict: Runtime Error):
x = int(input())

import bisect

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

primess = primes(x)
index = bisect.bisect_left(primess,x)
print(primess[index])

Fixed submission:
x = int(input())

import bisect

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

primess = primes(100010)
idx = bisect.bisect_left(primess,x)
print(primess[idx])

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

from bitarray import bitarray
import bisect

def index_to_number(i): return 2*i+3
def number_to_index(n): return (n-3)//2

LIMIT_NUMBER = 50
LIMIT_INDEX = number_to_index(LIMIT_NUMBER)+1

odd_primes = bitarray(LIMIT_INDEX)
# index  0 1 2 3
# number 3 5 7 9

odd_primes.setall(True)

for i in range(LIMIT_INDEX):
    if odd_primes[i] is False:
        continue
    n = index_to_number(i)
    for m in range(n**2, LIMIT_NUMBER, 2*n):
        odd_primes[number_to_index(m)] = False

primes = [index_to_number(i) for i in range(LIMIT_INDEX)
          if odd_primes[i] is True]
primes.insert(0,2)

index = bisect.bisect_left(primes,x)
print(primes[index])

Fixed submission:
x = int(input())

import bisect

def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

primess = primes(100010)
idx = bisect.bisect_left(primess,x)
print(primess[idx])
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

i = 1
ind = 0
if 1 in a:
    while i in a[ind:]:
    ind = a.index(i)
    i += 1
    print(n-i+1)
else:
    print(-1)


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

for i in a:
    if k == i:
        k += 1

if k == 1:
    print(-1)
else:
    print(n-k+1)

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

i = 1
if 1 in a:
    while i in a:
        del a[:a.index(i)]
        i += 1
    print(n-i+1)
else:
    print(-1)

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

for i in a:
    if k == i:
        k += 1

if k == 1:
    print(-1)
else:
    print(n-k+1)

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

i = 1
if 1 in a:
    while i in a:
        del a[:a.index(i)]
        i += 1
    print(n-i+1)
else:
    print(-1)

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

for i in a:
    if k == i:
        k += 1

if k == 1:
    print(-1)
else:
    print(n-k+1)

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

i = 1
if 1 in a:
    while i in a:
    del a[:a.index(i)]
    i += 1
    print(n-i+1)
else:
    print(-1)

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

for i in a:
    if k == i:
        k += 1

if k == 1:
    print(-1)
else:
    print(n-k+1)
Buggy python submission (verdict: Runtime Error):
s = input(S)
if s = "SUN":
    print("7")
elif s = "NON":
    print(6)
elif s = "TUE":
    print(5)
elif s = "WED":
    print(4)
elif s = "THU":
    print(3)
elif s = "FRI":
    print(2)
elif s = "SAT":
    print(1)

Fixed submission:
s = input()
if s == "SUN":
    print(7)
elif s == "MON":
    print(6)
elif s == "TUE":
    print(5)
elif s == "WED":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
elif s == "SAT":
    print(1)
Buggy python submission (verdict: Runtime Error):
from statistics import mean
import itertools
import math

n = int(input())
pos = [list(map(float,input().split())) for i in range(n)]

pos_comb = itertools.combinations(pos,2)
dis_list = []
for i in pos_comb:
    dis_list.append(math.sqrt((i[0][0]-i[1][0])**2+(i[0][1]-i[1][1])**2))

print(mean(dis_list)*(float(n)-1.0))

Fixed submission:
from statistics import mean
import itertools
import math

n = int(input())
pos = [list(map(float,input().split())) for i in range(n)]

pos_comb = itertools.combinations(pos,2)
dis_list = []
for i in pos_comb:
    dis_list.append(math.sqrt((i[0][0]-i[1][0])**2+(i[0][1]-i[1][1])**2))

print(mean(dis_list)*(float(n)-1.0))

Buggy python submission (verdict: Runtime Error):
from statistics import mean
import itertools
import math

n = int(input())
pos = [list(map(float, input().split())) for i in range(n)]

pos_comb = itertools.combinations(pos, 2)
dis_list = []
for i in pos_comb:
    dis_list.append(math.sqrt((i[0][0]-i[1][0])**2+(i[0][1]-i[1][1])**2))
print(mean(dis_list)*(float(n)-1.0))

Fixed submission:
from statistics import mean
import itertools
import math

n = int(input())
pos = [list(map(float,input().split())) for i in range(n)]

pos_comb = itertools.combinations(pos,2)
dis_list = []
for i in pos_comb:
    dis_list.append(math.sqrt((i[0][0]-i[1][0])**2+(i[0][1]-i[1][1])**2))

print(mean(dis_list)*(float(n)-1.0))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
factor = []

for i in range(1,int(n**1/2)+1):
    if n%i == 0:
        factor.append(i + n//i -2)

factor.sort()
print(factor[0])

Fixed submission:
n = int(input())
factor = []

for i in range(1,int(n**0.5)+1):
    if n%i == 0:
        factor.append(i + n//i)

factor.sort()
print(factor[0]-2)

Buggy python submission (verdict: Runtime Error):
n = int(input())
factor = []

for i in range(1,int(n**1/2)):
    if n%i == 0:
        factor.append(i + n//i -2)
    else:
        continue

print(min(factor))

Fixed submission:
n = int(input())
factor = []

for i in range(1,int(n**0.5)+1):
    if n%i == 0:
        factor.append(i + n//i)

factor.sort()
print(factor[0]-2)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
factor = []

for i in range(1,n+1):
    if n%i == 0:
        factor.append(i + n//i -2)
    else:
        continue

print(min(factor))

Fixed submission:
n = int(input())
factor = []

for i in range(1,int(n**0.5)+1):
    if n%i == 0:
        factor.append(i + n//i)

factor.sort()
print(factor[0]-2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = list(input())

count = 0
for i in range(n-1):
    if s[i] != s[i+!]:
        count += 1

print(count+1)

Fixed submission:
n = int(input())
s = list(input())

count = 0
while len(s)>1 :
    if s[0] == s[1]:
        s.pop(0)
    else:
        s.pop(0)
        count += 1

print(count+1)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(input())

count = 0
while len(s)>1 :
    if s[0] == s[1]:
        s.pop(0)
    else:
        s.pop(0)
        count += 1

print(count+1)

Fixed submission:
n = int(input())
s = list(input())

count = 0
while len(s)>1 :
    if s[0] == s[1]:
        s.pop(0)
    else:
        s.pop(0)
        count += 1

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

ans = list(range(n))
for i in range(n):
    ans[a[i]-1] = i+1
print(" ".join(map(str,ans)))

Fixed submission:
n = int(input())
if n%2 ==0:
  print(0.5)
else:
  print((n+1)/(2*n))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

ans = range(n)
for i in range(n):
    ans[a[i]-1] = i+1
print(" ".join(map(str,ans)))

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

ans = list(range(n))
for i in range(n):
    ans[a[i]-1] = i+1
print(" ".join(map(str,ans)))
Buggy python submission (verdict: Time Limit Exceeded):
import bisect

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

count = 0
a1 = sorted(a)
b1 = sorted(b)
c1 = sorted(c)
for i in c1:
    prior_c = bisect.bisect_left(b1,i)
    prior_c_list = b1[:prior_c]
    for j in prior_c_list:
        count += bisect.bisect_left(a1,j)

print(count)

Fixed submission:
import bisect

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

a1 = sorted(a)
c1 = sorted(c)
count = 0

for i in b:
    count += bisect.bisect_left(a1,i) * (n - bisect.bisect_right(c1,i))
    
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = (int(x) for x in input().split())
sum  = 1
for i in A:
    sum = sum * i
if(sum > (10**18)):
    print(-1)
else:
    print(sum)


Fixed submission:
A,B=(int(x) for x in input().split())
print(A*B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = (int(x) for x in input().split())
sum  = 1
for i in A:
    sum = sum * i
if(sum > (10**18)):
    print(-1)
else:
    print(sum)


Fixed submission:
A,B=(int(x) for x in input().split())
print(A*B)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if((A%3 == 0) or (B%3 == 0) or ((A+B)%3 == 0):
    print("Possible")
else:
    print("Impossible")


Fixed submission:
A,B = map(int,input().split())
if((A%3 == 0) or (B%3 == 0) or ((A+B)%3 == 0)):
    print("Possible")
else:
    print("Impossible")
Buggy python submission (verdict: Runtime Error):
A,B = map(int, int().split())
C = A + B
if(C >= 10):
    print("error")
else:
    print(C)


Fixed submission:
A,B = map(int, input().split())
C = A + B
if(C >= 10):
    print("error")
else:
    print(C)

Buggy python submission (verdict: Runtime Error):
A,B = map(int, int().split())
C = A + B
if (C >= 10):
    print("error")
else:
    print(C)


Fixed submission:
A,B = map(int, input().split())
C = A + B
if(C >= 10):
    print("error")
else:
    print(C)
Buggy python submission (verdict: Runtime Error):
a,b = input().split()
if(a==H):
    if(b==H):
        print("H")
    elif(b==D):
        print("D")
elif(a==D):
    if(b==H):
        print("D")
    elif(b==D):
        print("H")


Fixed submission:
a,b = input().split()
if(a=="H"):
    if(b=="H"):
        print("H")
    elif(b=="D"):
        print("D")
elif(a=="D"):
    if(b=="H"):
        print("D")
    elif(b=="D"):
        print("H")
Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
op = input().split()
if(op == "+"):
    print(a+b)
elif(op == "-"):
    print(a-b)


Fixed submission:
a,op,b=input().split()
if(op == "+"):
    print(int(a)+int(b))
elif(op == "-"):
    print(int(a)-int(b))
Buggy python submission (verdict: Runtime Error):
#おととい買ったペンキ
a = int(input())
#きのう買ったペンキ
b = int(input())
#今日買ったペンキ
c= int(input())
penki_list = [a,b,c]
#print(penki_list)
#print(set(penki_list))
print(len(set(penki_list)))


Fixed submission:
#おとといa、きのうb、今日c
a,b,c = (int(x) for x in input().split())
penki_list = [a,b,c]
print(len(set(penki_list)))
Buggy python submission (verdict: Runtime Error):
N,S=input().split()
ans=1
c=[1]*26
for i in S:
        c[ord(i)-ord('a')]+=1
for i in c:
        ans*=i
print(ans%1000000007-1)

Fixed submission:
S=input()
S=input()
ans=1
c=[1]*26
for i in S:
        c[ord(i)-ord('a')]+=1
for i in c:
        ans*=i
print(ans%1000000007-1)
Buggy python submission (verdict: Runtime Error):
N=input()
flag = 0
l=ken(N)
if l != 7:
        for i in range(7):
                g=N[0:i]+N[i+l-7:l]
                if g=='keyence':flag=1
        if flag==1:print("YES")
        else :print("NO")
else if N=='keyence':print("YES")
else print("NO")

Fixed submission:
N=input()
flag = 0
l=len(N)
if l != 7:
        for i in range(7):
                g=N[0:i]+N[i+l-7:l]
                if g=='keyence':flag=1
        if flag==1:print("YES")
        else :print("NO") 
elif N=='keyence':print("YES")
else :print("NO")
Buggy python submission (verdict: Runtime Error):
A=input()
A,B=input().split()
P=input().split()
c=[0]*3
for i in P:
        if P <= A:c[0]+=1
        elif P <= B:c[1]+=1
        else :c[2]+=1
c.sort()
print(c[0])

Fixed submission:
A=input()
A,B=input().split()
A=int(A)
B=int(B)
P=input().split()
c=[0]*3
for i in P:
        i=int (i)
        if i <= A:
                c[0]+=1
        elif i <= B:
                c[1]+=1
        else :
                c[2]+=1
c.sort()
print(c[0])
Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if A+B==15:print("+")
elif A*B==15:print("*")
else :print("x")

Fixed submission:
a = input().split(' ')
A = int(a[0])
B = int(a[1])
if A+B==15:print("+")
elif A*B==15:print("*")
else :print("x")

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if A+B==15:print("+")
else if A*B==15:print("*")
else :print("x")

Fixed submission:
a = input().split(' ')
A = int(a[0])
B = int(a[1])
if A+B==15:print("+")
elif A*B==15:print("*")
else :print("x")
Buggy python submission (verdict: Runtime Error):
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag==:print("Yes")
else :print("No")

Fixed submission:
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag==1:print("Yes")
else :print("No")

Buggy python submission (verdict: Runtime Error):
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag:print("Yes")
else flag:print("No")

Fixed submission:
N=input()
c=0
flag = 0
for i in N:
    if i=='C' and  c==0 :c+=1
    if i=='F' and c==1: flag=1
if flag==1:print("Yes")
else :print("No")
Buggy python submission (verdict: Runtime Error):
A, B = int(input())
print(A*B)

Fixed submission:
A, B = (int(x) for x in input().split())
print(A*B)
Buggy python submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split()]

count=0
sum=1
while(sum<b):
    sum+=a-1
    count+=1
print(count)


Fixed submission:
S = input()

T = input()
count = 0

s=[]
t=[]
for i in S:
    s.append(i)
for j in T:
    t.append(j)


if s[0]==t[0]:
    count+=1
if s[1]==t[1]:
    count+=1
if s[2]==t[2]:
    count+=1

print(str(count))

Buggy python submission (verdict: Runtime Error):
a,b = [int(i) for i in input().split()]

for B in range(1,21):

    if B==1 and a>=2:
        lim=B*a
    elif B>1 and a>=2:
        lim=(B-1)*(a-1)+a

    if lim>=b:
        break
print(B)


Fixed submission:
S = input()

T = input()
count = 0

s=[]
t=[]
for i in S:
    s.append(i)
for j in T:
    t.append(j)


if s[0]==t[0]:
    count+=1
if s[1]==t[1]:
    count+=1
if s[2]==t[2]:
    count+=1

print(str(count))

Buggy python submission (verdict: Runtime Error):
a, b, c = (i for i in input().split())

d, e, f = (i for i in input().split())

count = 0
if a==d:
    count+=1
elif d==e:
    count+=1
elif c==f:
    count+=1
print(str(count))


Fixed submission:
S = input()

T = input()
count = 0

s=[]
t=[]
for i in S:
    s.append(i)
for j in T:
    t.append(j)


if s[0]==t[0]:
    count+=1
if s[1]==t[1]:
    count+=1
if s[2]==t[2]:
    count+=1

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

num = [int(input()) for i in range(N)]

for i in num:

    sum = 1/i

answer = 1 / sum

print(int(answer))


Fixed submission:
N = int(input())

num = map(int,input().split())
sum = 0
for i in num:

    sum += 1/i

answer = 1 / sum

print(answer)
Buggy python submission (verdict: Runtime Error):
N = int(input())
L =[]
for i in range(N*2):
    guzai=int(input())
    L.append(guzai)

L.sort()
L_even=L[0::2]
goukei=sum(L_even)
print(str(goukei))

Fixed submission:
N = [int(v) for v in input().split()]
L = [int(v) for v in input().split()]
L.sort()
L_even=L[0::2]
goukei=sum(L_even)
print(str(goukei))

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

guzai=int(input())
L.append(guzai)

L.sort()
L_even=L[0::2]
goukei=sum(L_even)
print(str(goukei))


Fixed submission:
N = [int(v) for v in input().split()]
L = [int(v) for v in input().split()]
L.sort()
L_even=L[0::2]
goukei=sum(L_even)
print(str(goukei))
Buggy python submission (verdict: Runtime Error):
#intの場合
N = int(input()) #ここで標準入力

#List にしたい時
#intの場合
huga = list(map(long, input().split()))
ans = 1
flg = 0
for number in huga:
    ans = ans * number
    if ans > 10**18:
        flg = 1
        break

if flg == 0:
    print(ans)
else:
    print('-1')



Fixed submission:
#intの場合
L,R = map(int,input().split())

ans = L*R
print(ans)