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;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int input=0;
		int sosuko=0;
		long wa=0l;
		int genzai=0;
		boolean ss=false;
		while(sc.hasNext()) {
			input=sc.nextInt();
			sosuko=0;
			wa=0l;
			genzai=0;

			if(input>=1) {
				wa+=2;
				genzai=2;
				sosuko=1;
			}
			if(input==0) {
				System.exit(0);
			}
			genzai=3;
			while(input>sosuko) {
				ss=true;
				for(int j=2; j<=Math.sqrt(genzai)+1;) {
					if(genzai%j==0) {
						genzai+=2;
						ss=false;
						break;
					}
					j++;
				}
				if(ss==true) {
					wa+=genzai;
					sosuko++;
					genzai+=2;
				}
			}
			System.out.println(wa);
		}
	}
}
