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

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		ArrayList<Integer> index = new ArrayList<Integer>();
		ArrayList<Integer> search = new ArrayList<Integer>();
		for(int i=2; i<=110000; i++) search.add(i);
		index.add(2);
		while(index.get(index.size()-1) < Math.sqrt(110000)) {
			int now =  search.get(0);
			if(now != 2) index.add(now);
			int limit = search.size();
			for(int i=limit-1; i>=0; i--) if(search.get(i) % now == 0) search.remove(i);
		}
		for(int i=0; i<search.size()-1; i++) {
			index.add(search.get(i));
		}
		while(in.hasNext()) {
			int n = in.nextInt();
			if(n == 0) break;
			int sum = 0;
			for(int i=0; i<n; i++) {
				sum += index.get(i);
			}
			System.out.println(sum);
		}
	}
}