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

public class Main {

	public static void main(String[] args) {
		ArrayList<Integer> primes = prime(104740);
		Scanner sc = new Scanner(System.in);

			while (sc.hasNext()) {
				int n = sc.nextInt();

					if (n == 0) {
						break;
					}

				long sum = 0;

					for (int i = 0; i < n; i++) {
						sum += primes.get(i);
					}

				System.out.println(sum);
			}

		sc.close();

	}

	public static ArrayList<Integer> prime(int n) {
		boolean[] arr = new boolean[n];
		ArrayList<Integer> primes = new ArrayList<Integer>();
		int limit = (int)Math.sqrt(arr.length);

		for (int j = 2 ; j <= limit; j++) {
			for(int k = 2; k * j < arr.length; k++) {
				arr[k * j] = true;
			}
		}

		arr[0] = arr[1] = true;

		for (int i = 0; i < arr.length; i++) {
			if (!arr[i]) {
				primes.add(i);
			}
		}

		return primes;
	}
}
