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 math import sqrt
import sys
sys.setrecursionlimit(100000)

def prime(n):
    p = [1 for i in range(n)]
    p[0] = 0
    prime_ = []
    for i in range(2,int(sqrt(n))):
        if p[i-1] == 1:
            for i in range(2*i,n,i):
                p[i-1] = 0
    for i in range(n):
        if p[i] == 1:
            prime_.append(i+1)
    return prime_

prime_ = prime(105000)
sum_prime_ = [0 for i in range(10000)]

def sum_prime(n):
    global sum_prime_
    if n == 1:
        sum_prime_[n-1] = prime_[n-1]
        return sum_prime_[n-1]
    else:
        sum_prime_[n-1] = prime_[n-1] + sum_prime(n-1)
        return sum_prime_[n-1]

sum_prime(10000)

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

