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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;

class Main {

    public static void main(String[] args) throws IOException {
        doit(args, System.in, System.out);
    }

    static void doit(String[] args, InputStream in, PrintStream out)
            throws IOException {
        boolean[] sieve = new boolean[104729 + 1];
        for (int p = 2; p < Math.sqrt(sieve.length); p++) {
            if (sieve[p]) {
                continue;
            }
            for (int q = p * 2; q < sieve.length; q += p) {
                sieve[q] = true;
            }
        }
        int[] sums = new int[10001];
        int k = 0;
        for (int p = 2; p < sieve.length; p++) {
            if (sieve[p]) {
                continue;
            }
            k++;
            sums[k] = sums[k - 1] + p;
        }

        BufferedReader reader = new BufferedReader(new InputStreamReader(in));
        while (true) {
            int n = Integer.parseInt(reader.readLine());
            if (n == 0) {
                break;
            }
            out.println(sums[n]);
        }
    }
}