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.ArrayList;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Scanner;
public class Main {
	Scanner sc = new Scanner(System.in);
	 
	public static void main(String[] args) {
		new Main().AOJ0053();
	}
	
	
	void AOJ0053(){
		ArrayList<Integer> primes = primeTable(1000000);
		while(true){
			int ans = 0;
			
			int input = sc.nextInt();
			if(input == 0)break;
			
			for(int i = 0; i < input;i++){
				ans += primes.get(i);
			}
			
			System.out.println(ans);
		}
	}
	
	
	
	ArrayList<Integer> primeTable(int n){
		boolean[] table = new boolean[n];
		for(int i = 0; i < table.length; i++){
			table[i] = true;
		}
		
		table[0] = false;
		table[1] = false;
		
		for(int i = 2; i*i < n; i++){
			if(table[i] == false)continue;
			for(int j = i*2; j < n; j += i){
				table[j]=false;
			}
		}
		
		
		ArrayList<Integer> primelist = new ArrayList<Integer>();
		for(int i = 0; i < n; i++){
			if(table[i] == true)primelist.add(i);
		}
		return primelist;
	}
}