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
p = [1] * (110000 + 1)
p[0], p[1] = 0, 0
for i in range(2, int(110000 ** 0.5) + 1):
    if not p[i]:
        continue
    for j in range(2 * i, 110000 + 1, i):
        p[j] = 0

p_num = [i for i in range(110000) if p[i] == 1]

while 1:
    n = int(input())
    if n == 0:
        break
    print(sum(p_num[:n]))

