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.InputStream;
import java.io.InputStreamReader;
import java.util.Scanner;

class Main {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static Scanner sc = new Scanner(new InputStreamReader(System.in));

	public static void main (String[] args) throws Exception {
		int[] list = sumList(prime());
		while(true) {
			String str = br.readLine();
			int n = Integer.parseInt(str);
			if(n == 0) break;
			System.out.println(list[n-1]);
		}
	}
	
	public static int[] prime() {
		int[] list = new int[10000];
		list[0] = 2;
		list[1] = 3;
		list[2] = 5;
		list[3] = 7;
		list[4] = 11;
		list[5] = 13;
		int pit = 6;
		for(int i=17; pit<10000; i = i+2) {
			for(int j=1; list[j]*list[j] < i; j++) {
				if(i%list[j] == 0) break;
				if(list[j+1]*list[j+1] > i) {
					list[pit] = i;
					pit++;
				}
			}
		}
		return list;
	}
	
	public static int[] sumList(int[] list) {
		int[] sums = new int[10000];
		sums[0] = 2;
		for(int i=1; i<10000; i++) {
			sums[i] = sums[i-1] + list[i];
		}
		return sums;
	}
}