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;
 
public class Main{
	static Scanner sc = new Scanner(System.in);
	static int[] prin = new int[52365];
    
    static void SystemOut(){
    	while(sc.hasNext()){
            int n=sc.nextInt();
            if(n==0){
                break;
            }
            int ans=2;
            for(int i = 1;i < 52365;i++){
                if(prin[i] == 0)continue;
                if(n<2)break;
                ans+=(2*i+1);
                n--;
            }
            System.out.println(ans);
        }
    }
   
    void sub(){
        for(int i = 0;i < 52365;i++){
            prin[i]=1;
        }
        int temp1=3;
        while(true){
            if(temp1*temp1>104730){
                break;
            }else{
                if(prin[(temp1-1)/2] == 0){
                    temp1 += 2;
                }else{
                    int temp2 = temp1*temp1;
                    while(temp2 < 104730){
                        prin[(temp2-1)/2] = 0;
                        temp2 += 2*temp1;
                    }
                    temp1 += 2;
                }
            }
        }
        SystemOut();
   }
    
    public static void main(String[] args){
    	Main app=new Main();
    	app.sub();
       
    }
}