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.*;
public class Main{
    static Scanner kbd = new Scanner(System.in);
    public static void main(String[] args){
	int[] p = new int[1000000];
	setP(p);
	while(kbd.hasNext()){
	    int n = kbd.nextInt();
	    if(n!=0) solve(p, n);
	}
    }

    static void solve(int[] p, int n){
	int sum=0, i;
	for(i=0; p[i]<=n; i++){
	    if(p[i]!=-1) {
		sum+=i;
		//System.out.println(i);
	    }
	}

	System.out.println(sum);
    }

    static void setP(int[] p){
	int a=1, i, j;
	Arrays.fill(p, 1);
	p[0] = -1;
	p[1] = -1;
	for(i=2; i<p.length; i++){
	    if(p[i] == 1){
		//System.out.println(i+" "+a);
		p[i] = a;
		a++;	
	    }
	    for(j=i+i; j<p.length; j+=i){
		p[j] = -1;
	    }
	}
    }
}