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) {
		try(Scanner sc = new Scanner(System.in)) {
			boolean[] p = new boolean[104730];
			int[] s = new int[10001];
			int j = 0;
			s[j++] = 0;
			Arrays.fill(p, true);
			for(int i=2; i<104730; i++) {
				if(p[i]) {
					s[j] = s[j-1] + i;
					j++;
					for(int k=i*2; k<104730; k+=i) p[k] = false;
				}
			}
			
			while(true) {
				int n = sc.nextInt();
				if(n == 0) break;
				System.out.println(s[n]);
			}
		}
	}
}

