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.*;

class Main{
	public static void main(String[] args){
		int n;
		final int MAX_N = 10000;
		Scanner scan = new Scanner(System.in);
		ArrayList<Integer> al = new ArrayList<Integer>();
		for(int i = 2;al.size() < MAX_N;i++){
			boolean b = true;
			for(int j = 0;j < al.size();j++){
				if(i % al.get(j) == 0){
					b = false;
					break;
				}
			}
			if(b){
				al.add(i);
			}
		}
		al.add(0,0);
		for(int i = 1;i < al.size();i++){
			al.set(i, al.get(i - 1) + al.get(i));
		}
		while(true){
			n = scan.nextInt();
			if(n == 0){
				break;
			}
			System.out.println("" + al.get(n));
		}
	}
}