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.Scanner;


public class Main {
	static final int N = 10000;
	
	public static void main(String[] args) {
		new Main().solve();
	}
	
	void solve(){
		Scanner sc = new Scanner(System.in);
		
		// メモ化みたいな
		ArrayList<Long> p = new ArrayList<Long>();
		for(long i=2; p.size()<=N; ++i){
			boolean f = true;
			for(int j=0; j<p.size(); ++j){
				// いままでの素数で試し割り
				f &= i%p.get(j)!=0;
				if(!f) break;
			}
			if(f){
				p.add(i);
			}
		}
		
		while(true){
			int n = sc.nextInt();
			
			if(n==0) break;
			
			int sum = 0;
			
			for(int i=0; i<n; ++i){
				sum += p.get(i);
			}
			
			System.out.println(sum);
		}
		
		sc.close();
	}
	
	void debug(Object... os){
		System.err.println(Arrays.deepToString(os));
	}
}