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 IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str;
		int n;

		boolean prime[] = new boolean[110001];
		prime[0]=true;

		for(int i=2; i<prime.length; i++){
			if(!prime[i]){
				for(int j=i*2; j<prime.length; j=j+i){
					prime[j]=true;
				}
			}
		}

		while(!(str=br.readLine()).equals("0")){
			n = Integer.parseInt(str);
			solve(prime, n);
		}

	}

	static void solve(boolean p[], int n){
		int sum=0;
		int j=0;

		for(int i=2; i<p.length; i++){
			if(!p[i]){
				j++;
				sum += i;
				if(j==n)break;
			}
		}
		System.out.println(sum);
	}

}