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

public class Main{

	public static void main(String args[]){
		new Main().mainrun();
	}

	private Scanner scan;
	int max = 100000000;

	boolean[] Prime = new boolean[max];
	private void mainrun() {
		scan = new Scanner(System.in);
		Arrays.fill(Prime, true);

		Prime[0] = Prime[1] = false;
		
		for(int i = 2;i < Math.sqrt(max);i++) {
			if(Prime[i]) {
				for(int j = i * 2;j < max;j += i) {
					Prime[j] = false;
				}
			}
		}

		for(int N = scan.nextInt();N != 0;N = scan.nextInt()){
			int Ans = 0;
			int count = N;
			for(int i = 2; i < max && count != 0;i ++) {
				if(Prime[i]) {
					Ans +=i ;
					count--;
				}
			}
			System.out.println(Ans);
		}

	}
}
