Let p (i) be the i-th prime number from the smallest. For example, 7 is the fourth prime number from the smallest, 2, 3, 5, 7, so p (4) = 7.

Given n, the sum of p (i) from i = 1 to n s

s = p (1) + p (2) + .... + p (n)

Create a program that outputs. For example, when n = 9, s = 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 = 100.



Input

Given multiple datasets. Each dataset is given the integer n (n ≤ 10000). When n is 0, it is the last input. The number of datasets does not exceed 50.

Output

For n in each dataset, print s on one line.

Example

Input

2
9
0


Output

5
100
from itertools import accumulate, chain
ub = 105000
primes = {2, 3} | {m for n in (5, 7) for m in range(n, ub, 6)}
du = primes.difference_update
for n in chain(range(5, ub, 6), range(7, ub, 6)):
    if n in primes:
        du(range(n*3, ub, n*2))

cumsum = tuple(accumulate(primes))

while True:
    n = int(input())
    if n == 0:
        break
    print(cumsum[n-1])
