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

class Main {
  public static void main(String[] args) {
    int[] prime = new int[10000000];
    for(int i=0;i<10000000;i++) {
      prime[i]=0;
    }
    for(int i=2; i<10000000; i++) {
      if(prime[i]==1) {
        continue;
      }
      prime[i]=2;
      int j=i+i;
      while(j<10000000) {
        prime[j]=1;
        j+=i;
      }
    }
    Scanner sc = new Scanner(System.in);
    while(sc.hasNext()) {
      int n = sc.nextInt();
      if(n==0) {
        break;
      }
      int i=0;
      int j=0;
      int sum=0;
      while(i<n) {
        if(prime[j]==2) {
          sum+=j;
          i++;
        }
        j++;
      }
      System.out.println(sum);
    }
  }
}