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 {

	    public static void main(String[] args) throws java.io.IOException{
	        Scanner scan = new Scanner(System.in);
	       
	        while(true){
	        	
	        	int n=scan.nextInt();
	        	if(n==0)break;
	        	int count=0;
	        	int sum=0;
	        	for(int i=2;;i++){
	        		if(prime(i)){
	        			count++;
	        			sum+=i;
	        			if(count==n)break;
	        		}
	        	}
	        	System.out.println(sum);
	        }
	    }
	     public static boolean prime (int n){
	            if(n==1)return false;
	            for(int i=2;i<=Math.sqrt(n);i++)
	                if(n%i==0)return false;
	            return true;
	        }
}
	    