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 java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(
				System.in));
		StringBuilder builder = new StringBuilder();
		while (true) {
			int a = Integer.parseInt(reader.readLine());
			if (a == 0)
				break;
			int[] primes = new int[a * 100];
			for (int i = 2; i < a * 100; i++) {
				if (primes[i] == 1) {
					continue;
				}
				for (int j = i * 2; j < a * 100; j += i) {
					primes[j] = 1;
				}
			}
			int count = 0;
			long sum = 0;
			for (int i = 2; i < a * 100; i++) {
				if (primes[i] == 0) {
					sum += i;
					count++;
					if (count == a) {
						break;
					}
				}
			}
			System.out.println(sum);
		}

	}
}