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
import math
M = 104729
lst = list(range(M+1))

for i in range(0, M+1, 2):
    lst[i] = 0

lst[1] = 0
lst[2] = 2

for i in range(3, math.ceil(math.sqrt(M+1)), 2):
    if lst[i]:
        for j in range(i**2, M+1, i):
            lst[j] = 0

anslst = [i for i in lst if i != 0]

while True:
    n = int(input())
    if n == 0 :
        break

    print(sum(anslst[:n]))
