Problem:
 Score : 200 points    Problem Statement Given is a sequence of N integers A_1, \ldots, A_N .  Find the (multiplicative) inverse of the sum of the inverses of these numbers, \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}} .      Constraints  1 \leq N \leq 100  1 \leq A_i \leq 1000         Input Input is given from Standard Input in the following format:  N  A_1  A_2  \ldots  A_N       Output Print a decimal number (or an integer) representing the value of \frac{1}{\frac{1}{A_1} + \ldots + \frac{1}{A_N}} .  Your output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5} .        Sample Input 1 2
10 30      Sample Output 1 7.5  \frac{1}{\frac{1}{10} + \frac{1}{30}} = \frac{1}{\frac{4}{30}} = \frac{30}{4} = 7.5 .  Printing 7.50001 , 7.49999 , and so on will also be accepted.       Sample Input 2 3
200 200 200      Sample Output 2 66.66666666666667  \frac{1}{\frac{1}{200} + \frac{1}{200} + \frac{1}{200}} = \frac{1}{\frac{3}{200}} = \frac{200}{3} = 66.6666... .  Printing 6.66666e+1 and so on will also be accepted.       Sample Input 3 1
1000      Sample Output 3 1000  \frac{1}{\frac{1}{1000}} = 1000 .  Printing +1000.0 and so on will also be accepted.

Solution (Python):
from decimal import Decimal

cnt = int(raw_input())
elements = map(lambda x: Decimal(str(x)), raw_input().split())
div_elements = map(lambda x: 1 / x , elements)
print 1 / sum(div_elements)

Solution (Python):
count = int(input())
num = list(map(int,input().split()))
s = 0
for i in num:
    s += 1/i
print(1/s)

Solution (Python):
N = int(input())

A = list(map(int, input().split()))

ans = 0
tmp = 0

for i in range(N):
    tmp += 1/A[i]

ans = 1/tmp
print(ans)

Solution (Python):
N = int(input())

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

    sum += 1/i

answer = 1 / sum

print(answer)

Solution (Python):
N = int(input())
Lists = map(int,input().split())
sum = 0
for x in Lists:
  sum+=1/x
print(1/sum)

Solution (Python):
n=int(input())
a=[int(i) for i in input().split()]
ans=0
for i in a:
    ans+=1/i
print(1/ans)

Solution (Python):
n = int(input())
aa = map(int, input().split())
print(1 / sum([1 / a for a in aa]))

Solution (Python):
N = int(input())
Ai = list(map(int, input().split()))

answer = 0.0

for a in Ai:
    answer += 1 / a

print(1 / answer)

Solution (Python):
N = int(input())
Lists = map(int,input().split())
sum = 0
for x in Lists:
  sum+=1/x
 
print(1/sum)

Solution (Python):
import io
import sys
MOD = 10 ** 9 + 7

def IN_S():
  return input()


def IN_I():
  return int(input())


def IN_L_I():
  return list(map(int, input().split()))


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
3
200 200 200
'''


def MAIN():
  
  A()


def A():
  n = IN_I()
  nums = IN_L_I()
  t = 0
  for num in nums:
    t += 1 / num
  
  print (1 / t)
  return None


def B():
  return None


def C():
  return None


MAIN()

Solution (Python):
N = int(input())

L = list(map(int,input().split()))

ans = 0

for a in L:
    ans += (1/a)

ans = 1 / ans

print('{:.6f}'.format(ans))

Solution (Python):
num = int(input())
lists = list(map(int,input().split()))

sum = 0
for i in range(num):
  sum = sum + (1/lists[i])
  
print(1/sum)

Solution (Python):
input()
print(1/sum([1/int(i) for i in input().split()]))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

s = 0
for i in range(n):
    s += 1 / a[i]

print(1/s)

Solution (Python):
n = int(input())
nums = map(lambda x: 1 / int(x), input().split(' '))
print(1 / sum(nums))

Solution (Python):
N = int(input())


a = list(map(int, input().split()))

for i in range(N):
    a[i] = a[i]**-1  
ans = sum(a)
print(ans**-1)

Solution (Python):
N = int(input())
A = [int(zz) for zz in input().split()]

ans = 0
for i in A:
    ans += 1/i

print(1/ans)

Solution (Python):
N = 0
numbers = []

N = int(input())
numbers = [1/int(i) for i in input().split()]

print(1/sum(numbers))

Solution (Python):
n = int(input())

a = list(map(int, input().split()))

mother = 0

for i in range(n):
    mother += 1/a[i]

print(1/mother)

Solution (Python):
input();a=map(lambda a: 1/int(a),input().split())
print(1/sum(a))

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
sum=0
for i in range(n):
  sum=sum+(1/a[i])
print(1/sum)

Solution (Python):
N = int(input())
Alist = list(map(int,input().split()))
n1 = 1
for i in range(N):
    n1 *= Alist[i]
n2 = 0
for i in range(N):
   n2 += (n1//Alist[i])
print(n1/n2)

Solution (Python):
N = int(input())
A = [float(x) for x in input().split()]
from math import fsum

print(1/fsum([1/a for a in A]))

Solution (Python):
n=int(input())
s=input()
li=s.split()
x=0
for i in range(n):
    x=x+1/int(li[i])
print(1/x)

Solution (Python):
n = int(input())
arr = list(map(int,input().split()))
total = 0
for i in range(n):
    total += (1/arr[i])
print(1/total)

Solution (Python):
num = int(input())
string = input().split()
nums = [int(i) for i in string]

def inverse(n):
  return 1/n

inverseNums = [inverse(i) for i in nums]

sumInverseNums = sum(inverseNums)

print(inverse(sumInverseNums))

Solution (Python):
n = input()
a = input().split(' ')
a_int = [int(i) for i in a]

arev_sum = 0
for i in a_int:
    arev_sum += 1/i
    
ans = 1/arev_sum
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
inv_a = [1/i for i in a]
print(round(1/sum(inv_a), 5))

Solution (Python):











import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    A=LI()
    S = 0
    for a in A:
        S+=1/a
    print(1/S)
    

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
As = map(int, input().split())

res = 1/sum(list(map(lambda x: 1/x, As)))

print(res)

Solution (Python):
import numpy as np

n = int(input())
A = list(map(int, input().split(' ')))

A = np.array(A)
A = 1 / A
ans = 1 / A.sum()
print(ans)

Solution (Python):
N = int(input())
A = [int(a) for a in input().split()]
ans = 0
for a in A:
    ans += round(1 / a, 10)
print(round(1 / ans, 7))

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
tmp = 0
for i in range(n):
    tmp += 1/a[i]
print(1/tmp)

Solution (Python):
n=int(input())
arr=[int(x) for x in input().split(' ')]
deno=0
for item in arr:
  deno+=(1/item)
print(1/deno)

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
A = 0
for i in range(n):
  A += 1/l[i]
print(1/A)

Solution (Python):
n = int(input())
a = [int(s) for s in input().split(" ")]

mod = sum([1/i for i in a])
print(str(1/mod))

Solution (Python):
N = int(input())
l = list(map(int, input().split()))

ans = 0.0
for i in l:
    ans += 1 / i


print(1 / ans)

Solution (Python):

from itertools import *
import sys
import time










def read_array():
	N = int(input())
	A = map(int, raw_input().split())
	return A





A = read_array()
print 1./sum(1./a for a in A)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
t=0
for i in l:
  t+=1/i
print(1/t)

Solution (Python):


if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i in range(n):
        ans += 1.0/a[i]
    print(1/ans)

Solution (Python):
n = int(input())
print(1. / sum([1. / int(i) for i in input().split()]))

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
sum = 0
for i in a:
  sum += 1/i
print(1/sum)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))

a=1
for i in range(n):
    a*=l[i]
b=0
for i in range(n):
    b+=a/l[i]
print(a/(b*1.0))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

tmp = 0
for i in range(N):
  tmp += 1/A[i]
  
print(1/tmp)

Solution (Python):
from functools import reduce


n = int(input())
A = list(map(int, input().split()))
if n == 1:
    print(A[0])
else:
    numerator = reduce(lambda a, b: a * b, A)
    denominator = 0
    for i in range(n):
        denominator += reduce(lambda a, b: a * b, A[:i] + A[i+1:])
    print(1.0 * numerator / denominator)

Solution (Python):
n = int(input())
numbers = input()
numArr = str.split(numbers)
sum = 0
for i in range(n):
    sum += 1/int(numArr[i])
print(1/sum)

Solution (Python):
num = int(input())
num_list = list(map(int,input().split()))
num1 = 0
for n in range(num):
    num1+= 1/num_list[n]
print(1/num1)

Solution (Python):
n = int(input())
b = list(map(int, input().split(' ')))
sum = 0
for v in b:
    sum += 1/v
print( 1/sum )

Solution (Python):


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

a = [1/a[i] for i in range(len(a))]

s = sum(a)

print(1/s)

Solution (Python):
N = int(input())
Array = list(map(int,input().split()))
sum = 0.0
for i in Array:
    sum+=(1/float(i))
print(1/sum)

Solution (Python):
n = int(input())
a = map(int, input().split())

sum = 0.0
for x in a:
  sum = sum + 1 / x

print(1/sum)

Solution (Python):
N = int(input())
list = list(map(int,input().split()))
josu = 0


for i in range(len(list)):
    josu += 1/list[i]

ans = 1/josu















print(ans)

Solution (Python):
N = int(input())
A = list(map(float,input().split()))
s = 0.0
for i in range(N):
  s = s + (1.0/A[i])
print(1.0/s)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]

ans = 0

for i in range(n):
    ans = ans + float(1/a[i])

print(float(1/ans))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

t = 0
for i in A:
    t += 1 / i
print(1 / t)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
pi = 1
for i in range(n):
    pi = pi*a[i]
bottom = 0
for i in range(n):
    bottom += pi//a[i]
print(pi/bottom)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

temp = 0
for aa in a:
    temp += 1 / aa

print(1 / temp)

Solution (Python):


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

resist = sum([1 / x for x in a])
print(1 / resist)

Solution (Python):
N = int(input())
A = map(int,input().split())
print('{:.16g}'.format(1 / sum(1 /x for x in A)))

Solution (Python):
n = int(input())
a = 0
for x in map(int, input().split()):
  a += 1/x
print(1/a)

Solution (Python):
N = input()
list = []
list = [int(x) for x in input().split()]
wa = 0
for x in list:
    wa += 1/x

print(1/wa)

Solution (Python):
import sys
from fractions import Fraction
input = sys.stdin.readline


def inverse(f):
    return Fraction(f.denominator, f.numerator)


n = int(input())
a = list(map(int, input().split()))
sum_a = 0
for i in range(n):
    sum_a += Fraction(1, a[i])
print(float(inverse(sum_a)))

Solution (Python):

def get_answer(n, a):
    n = int(n)
    a = [int(v) for v in a.split(" ")]
    aa = [1/v for v in a]

    return 1 / sum(aa)


if __name__ == "__main__":
    input1 = input()
    input2 = input()
    print(get_answer(input1, input2))

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
s=0

N=int(input())
a=list(map(int,input().split()))

for i in range(0,N):
	s+=1/a[i]

print(1/s)

Solution (Python):
import numpy as np
n = int(input())
a = list(map(int, input().split()))
a_np = np.array(a)
output = 1 / (sum(1 / a_np))
print(output)

Solution (Python):
n = int(input())
total_1 = 1
total_2 = 0
al = list(map(int,input().split()))
for x in al:
    total_1 *= x
for y in al:
    total_2 += total_1/y
answer = total_1/total_2
print(answer)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
a = 0

for i in range(N):
  a+=1/A[i]

print(1/a)

Solution (Python):

N = int(input())

lst_A = input().split()
total = 0

for i in range(len(lst_A)):
    lst_A[i] = float(lst_A[i])
    total += 1/lst_A[i]

ans = 1/total

print(ans)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
total = 0

for i in range(len(a)):
    total += 1/a[i]

print(1/total)

Solution (Python):
M = int(input())
D = 0
for N in list(map(int, input().split())):
  D += (1 / N)
print (1 / D)

Solution (Python):
a = int(input())
l = list(map(int,input().split()))
for i in range(a):
    l[i] = 1/l[i]
print(1/sum(l))

Solution (Python):

a = int(input())
l = list(map(int,input().split()))
for i in range(a):
    l[i] = 1/l[i]
print(1/sum(l))

Solution (Python):
n = int(input())
ans = 0
input = input()
input_array = input.split(" ")
for item in input_array:
    ans=ans+1.0/int(item)
print(1/ans)

Solution (Python):
N = int(input())
A = sum([1/num for num in map(int, input().split())])

print(1/A)

Solution (Python):
N=int(input())
S=list(map(int,input().split()))



sum1=0
sum2=1

for i in range(N):
    sum1+=1/S[i]



A=1/sum1
print(A)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

a_inv = [0] * N

for n in range(N):
    a_inv[n] = 1 / A[n]

a_inv_sum = sum(a_inv)

print(1 / a_inv_sum)

Solution (Python):
N = int(input())
a_list = list(map(int, input().split()))
ans = 0
for a in a_list:
    ans += 1.0 / a
print(1/ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
m=0
for i in range(n):
  m+=1/a[i]
print(1/m)

Solution (Python):
from functools import reduce

def gcd_base(x,y):
    while y!=0:
        x,y = y,x%y
    return x

def gcd(num):
    return reduce(gcd_base,num)

def lcm_base(x,y):
    return (x * y) // gcd_base(x,y)

def lcm(num):
    return reduce(lcm_base,num,1)

def calc_denom(l,numer):
    cnt = 0
    for x in l:
        cnt += numer//x
    return cnt

N = int(input())
l = list(map(int,input().split()))
numer = lcm(l)
denom = calc_denom(l,numer)
print(numer/denom)

Solution (Python):
from fractions import Fraction
n = int(input())
a = list(map(lambda x: Fraction(1, int(x)), input().split()))
print(float(Fraction(1, sum(a))))

Solution (Python):


def solve():
    N = int(input())
    As = list(map(int, input().split()))

    total = 0
    for i in range(N):
        total += 1/As[i]
    
    print(1/total)

if __name__ == "__main__":
    solve()

Solution (Python):
N = int(input())
A = [int(_) for _ in input().split()]

print(1 / sum([1/a for a in A]))

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
total = 0
for i in range(N):
  total += 1 / a[i]

total2 = 1 / total
print(total2)

Solution (Python):


N=int(input())
A=list(map(int, input().split()))
total=0
for i in range(N):
    total+=1/A[i]
else:
    total=1/total

print(total)

Solution (Python):
N = int(input())
l = list(map(int, input().split()))

s = 0

for i in range(N):
    s += 1/l[i]

print(1/s)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    A[i] = 1/A[i]
print(1/sum(A))

Solution (Python):
import numpy as np

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

ans = 1/sum(1/np.array(a))
print(ans)

Solution (Python):
from fractions import Fraction
N = int(input())
li = list(map(int, input().split()))
A = 0
for i in range(N):
  A += Fraction(1, li[i])
print(A.denominator / A.numerator)

Solution (Python):
from functools import reduce

n = int(input())

arr = list(map(int, input().split()))

numerator = prod = reduce(lambda x, y: x*y, arr)
denomenator = sum(prod//ele for ele in arr)

ans = numerator/denomenator
print(ans)

Solution (Python):
N = int(input())
A = map(int,input().split())
A = list(A)
A = map(lambda x: 1 / x, A)
A = list(A)
sum = 0
for A_i in A:
    sum += A_i
print(1 / sum)

Solution (Python):
import numpy as np

n=int(input())
a=list(map(float,input().split()))
s=1

for i in range(n):
  s *= a[i]

b=[s/a[j] for j in range(n)]

print(s/np.sum(b))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
d = 0
for i in range(n):
    d += 1 / a[i]
print(1 / d)

Solution (Python):
n = int(input())
a = list(map(float, input().split()))
s = 0.0
for i in range(n):
    a[i] = 1 / a[i]
    s += a[i]
s = 1 / s
print(s)

Solution (Python):
n = int(input())
list = list(map(int, input().split()))

score = 0
for value in list:
  score += 1 / value

print(1 / score)

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

N = int(input())
A = LI()


ans_reverse = 0
for i in range(N):
    ans_reverse += 1 / A[i]
print(1/ans_reverse)

Solution (Python):
n=int(input())
list_a=list(map(float,input().split()))
list_b=[1/i for i in list_a]

print(1/sum(list_b))

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
ans=0
for i in A:
    ans+=1/i
print(1/ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n):
    b+=1/a[i]
print(1/b)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n):
    b+=1/a[i]
print(1/b)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += 1/a[i]
print(1/(sum))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
upper = 1
for i in range(0, N):
	upper *= A[i]
under = 0
for i in range(0, N):
	under += upper // A[i]
print(upper / under)

Solution (Python):
num=int(input())
array = list(map(int, input().strip().split()))

wa=0
for i in range(num):
    wa=wa+(1/array[i])
print(1/wa)

Solution (Python):
n=int(input())
a=map(int,input().split())
print("{:.16g}".format(1/sum(1/x for x in a)))

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]

b = 0
for x in a:
    b += 1/x

print(1/b)

Solution (Python):
N = int(input())
list_A = list(map(int,input().split()))
s = 0
for i in range(N):
  s += 1/list_A[i]
print(1/s)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
import numpy as np
npa = np.array(a)
print(1/(sum(1/npa)))

Solution (Python):
from fractions import Fraction
input()
s=map(int, input().split())
s=[Fraction(1, i) for i in s]
s=Fraction(1, sum(s))
res=s.numerator / s.denominator
print(res)

Solution (Python):
import math
import copy
import sys


inputa = input().split()



a = int(inputa[0])








inputb = input().split()
inputbList = [float(n) for n in inputb]













tmpSum = 0

for i in range(a):
    tmpSum += 1/inputbList[i]

print(1/tmpSum)

Solution (Python):
n = int(input())
a = map(int,input().split())
div_a = list(map(lambda x: 1/x,a))
ans = 1/sum(div_a)
print(ans)

Solution (Python):
N = int(input())
a_ls = [int(i) for i in input().split()]
print(1 / sum([1 / a for a in a_ls]))

Solution (Python):
n=int(input())
a=[int(i)for i in input().split()]
x=0
for i in a:
    x+=1/i
print(1/x)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
t=0
for i in range(n):
  t+=1/a[i]
print(1/t)

Solution (Python):
n = int(input())
a = map(int, input().split())
print('{:.16g}'.format(1/sum(1/x for x in a)))

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
b = 0
for i in range(N):
	b +=(1/a[i])

print(1/b)

Solution (Python):
n=input()
a=str(input())
li = list(a.split(" "))
result = 0
for num in li:
    result += 1/int(num)
    
print(1/result)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]

ans = 0

for i in a:
    ans += 1 / i

print(1 / ans)

Solution (Python):
n = int(input())
nums = list(map(int, input().split()))

A = 0

for x in nums:
    A += 1 / x

print(1 / A)

Solution (Python):
n = int(input())
arr= [1/int(x) for x in input().split()]
print(1/sum(arr))

Solution (Python):
n = int(input())
A = list(map(int, input().split()))

for i in range(len(A)):
    A[i] = 1 / A[i]

print(1 / sum(A))

Solution (Python):
_ = int(input())
ales = sorted(list(map(int, input().split())))[::-1]
def gcd(a, b):
  while b != 0:
    a, b = b, a%b
  return a
def lcm(a, b):
  return a * b / gcd(a, b)
k = ales[0]
for a in ales[1:]:
  k = lcm(k, a)
numerator = int(k/ales[0])
for a in ales[1:]:
  numerator += int(k/a)
print(k/numerator)

Solution (Python):
int(input())
lst = map(int,input().split(" "))
bunsi = 1
bunbo = 0
for e in lst:
    bunbo += 1/e
    
print(bunsi / bunbo)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
assert len(A) == N

print(1.0 / sum(1.0 / a for a in A))

Solution (Python):
N = int(input())
a = list(map(int,input().split()))

acc = 0

for i in a:
    acc += 1/i

print(1/acc)

Solution (Python):
n=int(input())
ans=0
A=list(map(int,input().split()))
for i in range(n):
  ans+=A[i]**(-1)
  
print(ans**(-1))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

rev = []
for a in A:
  rev.append(1.0/float(a))
  
print(1.0/float(sum(rev)))

Solution (Python):

MOD = 10 ** 9 + 7

N = int(input())
A = map(int, input().split())

ans = 0
for a in A:
    ans += 1/a

print(1/ans)

Solution (Python):
a = int(input())
b = list(map(int, input().split()))
result = 0
for number in range(a):
    result += 1/b[number]


print(1 / result)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

rev = 0
for a in A:
    rev += 1/a

print(1/rev)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
sub_sum = 0
for i in range(n):
    sub_sum += 1/a[i]
print(1/sub_sum)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))

b = 0
for i in range(n):
  b = b + 1 / a[i]

print(1 / b)

Solution (Python):
N = int(input())
A = map(int, input().split())
print("{:.16f}".format( 1 / sum(1 / x for x in A)))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
s = 0
for i in a:
    s += (1 / i)
print(1 / s)

Solution (Python):
n = int(input())
A = list(map(int,input().split()))

A = map(lambda x: 1 / float(x), A)
sum_A = sum(A)
ans = 1/sum_A

print(ans)

Solution (Python):
N=int(input())
b=input().split(" ")
sum=0
for i in range(0,N):
    sum+=1/int(b[i])
print(1/sum)

Solution (Python):
n = int(input())
A = list(map(int,input().split()))
for i in range(n):
  A[i] = 1 / A[i]
print(1 / sum(A))

Solution (Python):
import sys
input = sys.stdin.readline
from operator import itemgetter

def main():
	n = int(input().strip())
	v = list(map(int, input().strip().split()))
	d = sum(1/x for x in v)
	print("{:.5f}".format(1/d))

if __name__ == '__main__':
	main()

Solution (Python):
N = int(input())
A = list(map(int,input().split()))

temp = 0

for i in range(N):
  temp += 1/A[i]

ans = 1/temp

print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

sum = 0
for i in range(n):
    sum += 1/a[i]
print(1/sum)

Solution (Python):
N = int(input())
A = list(map(float, input().split()))

ans = 0
for Ai in A:
    ans += 1/Ai

print(1/ans)

Solution (Python):
def main():
    n = int(input())
    a = list(map(int,input().split()))

    b = a[0]
    for i in range(1,n):
        b = b * a[i] // gcd(b,a[i])
    ans = 0
    for i in a:
        ans = ans + b // i
    print(b/ans)

def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
a=list(map(int, input().split()))
a_=[1/a[i] for i in range(len(a))]
A=sum(a_)
print(1/A)

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]

r = 0
for a in A:
    r += (1/a)
print(1/r)

Solution (Python):
N = int(input())
sum = 0
a = input().split(" ")
a_list = [int(j) for j in a]
for k in a_list:
    sum += 1/k
print(1/sum)

Solution (Python):
n=int(input())
L=list(map(int,input().split()))
m_sum=0
for i in range(n):
	m_sum+=1/L[i]
print(1/m_sum)

Solution (Python):


n = int(input())

a = map(float, input().split())
sum = 0.0
for e in a:
	sum += 1/e
print(1/sum)

Solution (Python):
def solve(n, a):
    res = 0
    for i in range(n):
        res += 1.0 / a[i]
    return 1.0 / res

n = int(input())
a = list(map(int, input().split()))
print(solve(n, a))

Solution (Python):


_ = input()
A = list(map(int, input().split()))

numerator = 1
for a in A:
    numerator *= a


denominator = 0
for a in range(len(A)):
    denominator += (numerator / A[a])



print(numerator / denominator)

Solution (Python):
n=int(input())
a=list(map(float,input().split()))
ans=0
for i in a:
    ans+=(1/i)
print(1/ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
nums = []
for a in A:
    nums.append(1/a)
print(1/sum(nums))

Solution (Python):
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
a = 1/a
print(1/sum(a))

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
bo=sum([1/i for i in a])
print(1/bo)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))

x=0
for i in range(n):
  x+=1/a[i-1]
print(1/x)

Solution (Python):
from decimal import *
input()
N = list(map(int, input().split()))
count = sum(map(lambda x: Decimal(1) / Decimal(x), N))
print(float(Decimal(1) / Decimal(count)))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

denominator = 0
for i in a:
    denominator += 1 / i
dst = 1 / denominator
print(dst)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
sum = 0
for i in range(N):
  sum += 1/A[i]
answer =1/sum
print(answer)

Solution (Python):
n = int(input())
a_list = list(map(int, input().split()))
res = []
for a in a_list:
    res.append(1/a)
print(1/sum(res))

Solution (Python):
N = int(input())
A = [int(arr) for arr in input().split()]

rA = list(map(lambda x:1/x,A))
ans = 1/sum(rA)
print(ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
B = 0 

for i in range(N):
    B += 1/A[i]
print(1/B)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
i = 0
B = 0
while i <= N-1:
  B += 1/A[i]
  i = i + 1
answer = 1 / B
print(answer)

Solution (Python):



def main():
    n = int(input())
    a = list(map(int, input().split()))
    total = 0

    for ai in a:
        total += 1 / ai

    print(1 / total)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = map(int, input().split())
print(1/sum(1/i for i in a))

Solution (Python):
total_num = int(input())
numbers = input().split()
reverse_sum = 0

for number in numbers:
  reverse_sum += 1 / int(number)
  
answer = 1 / reverse_sum

print(answer)

Solution (Python):
N = int(input())
A = map(int, input().split())

print(1 / sum([ 1. / x for x in A]))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
s = 1
for i in range(n):
	s *= a[i]

p = s
q = 0
for i in range(n):
	q += s / a[i]
print("%.6lf" % (p / q))

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
print(1/sum(float(1/i) for i in a))

Solution (Python):
n=int(input())
a=[]
p=[int(e) for e in input().split()]
i=0
while i<n:
  a=a+[1/p[i]]
  i+=1
x=sum(a)
print(1/x)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split(' ')]

s = 0
for e in a:
    s += 1 / e

print(1 / s)

Solution (Python):
import sys
from operator import itemgetter 
from fractions import gcd 
from math import ceil, floor, sqrt 
from copy import deepcopy 
from collections import Counter, deque 
import heapq
from functools import reduce
sys.setrecursionlimit(200000)

input = sys.stdin.readline




n = int(input())

a = list(map(int, input().split()))

total = 0
for i in a:
    total += 1/i

print(1/total)

Solution (Python):
N = int(input())
Alist = map(int,input().split())
print(1/sum([1/A for A in Alist]))

Solution (Python):
n = int(input())
a_seq = list(map(int, input().split()))
b_seq = [0] * n

for i in range(n):
    b_seq[i] = 1 / a_seq[i]

ans = 1 / sum(b_seq)
print(ans)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
b = 0
for i in range(N):
    b = b + 1 / a[i]
print(1 / b)

Solution (Python):
N = int(input())
A = [int(s) for s in input().split()]
a = 0
for i in range(N):
    a += 1/A[i]
print(1/a)

Solution (Python):
N = input()
a = input()
l = a.split()
temp = 0
for num in l:
  temp = temp + 1/int(num)

print(1/temp)

Solution (Python):
N = int(input())
A = map(int, input().split())
A_inv = [1/x for x in A]
r = 1 / sum(A_inv)
print(r)

Solution (Python):
def main():
    n=int(input())
    a = list(map(int,input().split()))
    ans=0
    for i in range(n):
        ans+=1/a[i]
    ans=1/ans
    print(ans)
    
main()

Solution (Python):

N = int(input())


A = list(map(int, input().split()))


for i in range(len(A)):  
  A[i] = 1 / A[i]


print("{}".format(1 / sum(A)))

Solution (Python):
n = int(input())
A = list(map(int,input().split()))
total = 0
for i in A:
  total += 1/i
print(1/total)

Solution (Python):
N=int(input())
print(1/sum([1/i for i in list(map(int,input().split()))]))

Solution (Python):
n = int(input())
a = [1/int(i) for i in input().split()]
print(1/sum(a))

Solution (Python):
n=int(input())
a=list(map(int, input().split()))
print(1/sum([1/x for x in a]))

Solution (Python):
n = int(input())
m = list(map(int,input().split()))
o = []
for i in m:
  o.append(1/int(i))
s = sum(o)
print(1/s)

Solution (Python):
n = int(input())
a = [1/int(i) for i in input().split()]
print(1/sum(a))

Solution (Python):
n = int(input())
m = list(map(int,input().split()))
o = []
c  = 0
for i in m:
  o.append(1/m[c])
  c += 1
s = sum(o)
print(1/s)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
Sum = 0
for i in range(N):
    Sum += 1 / A[i]
print(1 / Sum)

Solution (Python):
n = int(input())
a = [int(x) for x in input().split()]

sm = 0
for i in a:
    sm += 1/i
print(1/sm)

Solution (Python):
n = input()
a = list(map(int, input().split()))
ans = 0
for x in a:
    ans += 1 / x
ans = 1 / ans
print(ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))

sum = 0
for i in range(N):
  sum += (1/A[i])

print(1/sum)

Solution (Python):
input()
print(1/sum(1/int(s) for s in input().split()))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

denominator = 0
for i in range(N):
    denominator += 1 / A[i]
print(1 / denominator)

Solution (Python):
N = int(input())
A = [1/int(inp) for inp in input().split()]
print(1/sum(A))

Solution (Python):

N = int(input())
A = list(map(int, input().split(' ')))
div_a = []
for a in A:
  div_a.append(1/a)
print(1/sum(div_a))

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
GS = 0
for i in range(N):
    GS += 1/A[i]
GGS = 1/GS
print(GGS)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
s = 0
for i in range(N):
  s += 1/A[i]
print(1/s)

Solution (Python):
n = input()
try:
    n = int(n)
    
    v = [int(x) for x in input().split(' ')]
    
    sum = 0
    for i in range(len(v)):        
        sum += 1/v[i]
        
    sum = 1 / sum
    print(sum)

    
except ValueError:
    print("数値を入力してください")

Solution (Python):
N = int(input())
k = list(map(int,input().split()))
sum = 0
for i in range(N):
  sum += 1/k[i]
print(1/sum)

Solution (Python):
n = int(input())
a = map(int, input().split())

print('{:.16g}'.format(1 / sum(1 / x for x in a)))

Solution (Python):
N=int(input())
A=input().split()
den=0
for i in range(N):
    den+=1/int(A[i])
print(1/den)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
inv = [1/a for a in A]
print(1/sum(inv))