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

public class Main{
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		Map<Integer, Integer> prime = new LinkedHashMap<Integer, Integer>();
		List<Integer> result = new ArrayList<Integer>();
		
		prime.put(1,2); prime.put(2,5);
		int[] p = new int[10000];
		p[0] = 2; p[1] = 3;
		int k = 2;
	outer:	for(int i = 5; k < 10000; i += 2){
			for(int j = 1; p[j] <= Math.sqrt(i); j++){
				if( i%p[j] == 0 ){
					continue outer;
				}
			}
			p[k] = i;
			k++;
			prime.put(k, prime.get(k-1)+i);
		}
		
		int n;
		while( (n = stdIn.nextInt()) != 0 ){
			result.add(prime.get(n));
		}
		
		for(Integer sum : result){
			System.out.println(sum);
		}
	}
}