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.Arrays;
import java.util.Scanner;

public class Main 
{
	public static void main(String arg[])
	{
		Scanner sc = new Scanner(System.in); 
		while(sc.hasNext())
		{
			int n = sc.nextInt();
			if(n==0)
				return;
			int ans =0;
			boolean a[] = new boolean[1000001];
			Arrays.fill(a, true);
			a[0]=a[1]=false;

			for(int i=0; i*i<=1000000; i++)
			{
				if(!a[i])
					continue;
				for(int j=i+i; j<=1000000; j+=i)
				{
					a[j] = false;
				}
			}

			int i=0;
			while(n>0)
			{
				
				if(a[i])
				{
					ans+=i;
					n--;
				}
				i++;
			}
			System.out.println(ans);
		}
	}
}