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

class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int[] sum = new int[10001];
        int number = 1;

        for (int i = 1; i <= 10000; i++) {
            while (!isPrime(++number))
                ;

            sum[i] = number + sum[i - 1];
        }

        String line;
        while (!(line = br.readLine()).equals("0")) {
            System.out.println(sum[Integer.parseInt(line)]);
        }

    }

    static boolean isPrime(int n) {
        for (int i = 2; i <= (int) (Math.sqrt(n)); i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }
}
