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 {
    public static void main(String[] args){
    	Scanner input = new Scanner(System.in);
    	while(true){
    		int num = input.nextInt();
    		if(num == 0)break;
    		System.out.println(prime(num));
    	}
    }
    
    public static long prime(int n){
    	long sum = 0;
    	int index = 0;
    	int num = 1;
    	while(index != n){
    		boolean isprime = true;
    		if(num == 1){
    			num++;
    		}else if(num == 2){
    			sum += 2;
    			index++;
    		}else{
    			if(num % 2 != 0){
    				for(int i = 3 ; i <= Math.sqrt(num) ; i+=2){
    					if(num % i == 0){
    						isprime = false;
    						break;
    					}
    				}
    			}else{
    				isprime = false;
    			}
    		}
    		if(isprime){
    			sum += num;
    			index++;
    		}
    		num++;
    	}
    	return sum;
    }
}