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.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int prime[];
		int n;
		int sum;
		int count;

		prime = new int[1300000];
		for (int i = 2; i * i <= 1300000; i++) {
			for (int j = 2; 0 <= i * j && i * j < 1300000; j++) {
				prime[i * j] = 1;
			}
		}
		n = sc.nextInt();
		while (n != 0) {
			sum = 0;
			count = 0;
			for (int i = 2; count < n; i++) {
				if (prime[i] == 0) {
					sum += i;
					count++;
				}
			}
			System.out.println(sum);
			n = sc.nextInt();
		}
	}
}