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{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int n = 104729;
    int counter = 0;
    boolean[] isprime = new boolean[n+1];
    for (int i = 2; i <= n; i++) {
      isprime[i] = true;
    }
    for (int i = 2; i*i <= n; i++) {
      if(isprime[i]) {
        for (int j = 2*i; j <= n; j += i) {
          isprime[j] = false;
        }
      }
    }
    while(true) {
      n = sc.nextInt();
      if(n == 0) {
        break;
      }
      int sum = 0;
      int j = 0;
      for (int i = 0; i < n;) {
        if(isprime[j]) {
          sum += j;
          i++;
        }
        j++;
      }
      System.out.println(sum);
    }
  }
}