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 {
	Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		new Main();
	}

	public Main() {
		new aoj0053().doIt();
	}

	class aoj0053 {	
		int prime[] = new int [300001];
		boolean is_prime[] = new boolean[300001];
		void sieve(int n){
			int p = 0;
			for(int i = 0;i <=n;i++)is_prime[i] = true;
			for(int i = 2;i <= n;i++){
				if(is_prime[i]){
					prime[p++]=i;
					for(int j = 2*i;j <= n;j+=i)is_prime[j] = false;
				}
			}
		}
		void doIt() {
			sieve(300000);
			while (true) {
				int n = sc.nextInt();
				if(n == 0)break;
				int cnt = 0;
				int cnt2 = 2;
				int ans = 0;
				while(cnt < n){
					if(is_prime[cnt2]){
						ans = ans + cnt2;
						cnt++;
					}
					cnt2++;
				}
				System.out.println(ans);
			}
		}
	}
}