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.io.*;
import java.util.*;

class Main{
    public static void main(String[] args){
	BufferedReader sc=new BufferedReader(new InputStreamReader(System.in));
	LinkedList<Integer> list = new LinkedList<Integer>();
	boolean[] prime = new boolean[110000];
	int[] s = new int[10000];
	prime[0] = true; prime[1] = true;
	for(int i=2; i<Math.sqrt(110000); i++)
	    if(!prime[i])
		for(int j=i*i; j<110000; j+=i)
		    prime[j] = true;
	for(int i=2; i<110000; i++)
	    if(!prime[i])
		list.add(i);
	s[0] = list.poll();
	for(int i=1; i<10000; i++)
	    s[i] = s[i-1]+list.poll();
	try {
	    while(true){
		int n = Integer.valueOf(sc.readLine());		
		if(n==0)
		    break;
		System.out.println(s[n-1]);
	    }
	}catch(Exception e){
	    System.out.println("Error");
	}
    }
}