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 scan = null;
		try{
			int num;
			int[] prime = new int[10000];
			prime[0] = 2;
			for(int i = 3 ,j = 1;j <prime.length;i += 2){
				boolean check = false;
				for(int k = 3; k < i /2; k += 2){
					if(i % k ==0){
						check = true;
						break;
					}
				}
				if(!check){
					prime[j] = i;
					j++;
				}
			}
			for(scan = new Scanner(System.in);(num = scan.nextInt()) !=0;){
				int sum = 0;
				for(int i = 0; i < num;i++){
					sum += prime[i];
				}
				System.out.println(sum);
			}
		}finally{
			if(scan !=null)scan.close();
		}
	}
}