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
count=2
i=3
prime=[2,3]
for i in range(5,1000000,2):
    if count==10000:break
    check=1
    for j in range(2,int(i**0.5)+1):
        if i%j==0:
            check=0
            break
    if check==1:
        prime.append(i)
        count+=1
while 1:
    n=int(input())
    if n==0:break
    print(sum(prime[:n]))
