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
Max=1000000
Sqrt=1000
def prime_number():
    count=[]
    prime=[True for i in range(Max)]
    for i in range(4,Max,2):
        prime[i]=False
    for i in range(3,Sqrt,2):
        if prime[i]==True:
            for j in range(i*2,Max,i):
                prime[j]=False       
    for k in range(2,Max):
        if prime[k]==True:
            count.append(k)
    return count
box=prime_number()
while 1:
    try:
        ans=0
        N=int(input())
        if N==0:break
        for i in range(N):
            ans +=box[i]
        print(ans)
    except:break

