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
# AOJ 0053: Sum of Prime Numbers
# Python3 2018.6.15 bal4u

MAX = 104729  # 10000th prime
SQRT = 323    # sqrt(MAX)

prime = [True for i in range(MAX+2)]
def sieve():
	for i in range(2, MAX, 2):
		prime[i] = False
	for i in range(3, SQRT, 2):
		if prime[i] is True:
			for j in range(i*i, MAX, i):
				prime[j] = False

sieve()
sum = [0 for i in range(MAX+2)]
j = 2
sum[1] = 2;
for i in range(3, MAX+1, 2):
	if prime[i] is True:
		sum[j] = sum[j-1] + i
		j += 1

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