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

public class Main {
    public static final int numMax = 300000;

    private static int[] primes = new int[10000];

    public static void main(String[] argv) throws IOException {
        boolean[] primeFlag = new boolean[numMax];
        Arrays.fill(primeFlag, true);
        int primesIndex = 0;
        for (int i = 2; i < numMax; i++) {
            if (primeFlag[i]) {
                primes[primesIndex++] = i;
                if (primesIndex >= 10000) {
                    break;
                }
                for (int j = i + i; j < numMax; j += i) {
                    primeFlag[j] = false;
                }
            }
        }
        //*
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        while (true) {
            String s = in.readLine();
            if (s == null || s.equals("0")) {
                break;
            }
            f(s);
        }
        //*/
    }

    public static void f(String s) {
        int sum = 0;
        int loop = Integer.parseInt(s);
        for (int i = 0; i < loop; i++) {
            sum += primes[i];
        }
        System.out.println(sum);
    }
}