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

class Main {

    static boolean primes [];

    static void makeTable () {

        primes = new boolean [200000];
        
        for(int i = 2; i < 200000; i++) {
            primes[i] = true;
        }

        for(int i = 2; i < 200000; i++) {
            if(primes[i]) {
                for (int n = 2 * i; n < 200000; n += i) primes[n] = false;
            }
        }

    }

    static int solve(int n) {
        int sum = 0;
        int added = 0;
        int i = 2;

        while (added < n) {
            if (primes[i]) {
                sum += i;
                added += 1;
            }
            i += 1;
        }

        return sum;
    }

    public static void main (String [] args) {

        Scanner sc = new Scanner(System.in);

        makeTable();

        while(true) {
            int n = sc.nextInt();
            if (n == 0) break;
            else        System.out.println(solve(n));
        }


    }
}