//编译程序求质数的和,如f(7)=2+3+5+7+11+13+17=58
import java.util.Scanner;
public class TestPrimeSum
{
static final long MAX_VALUE = 20000000l;
public boolean isPrime(int value)
{
for (int i = 2; i <= (int) Math.sqrt(value); i++)
{
if (value % i == 0) { return false; }
}
return true;
}
public long getSum(int num)
{
// Scanner scanner=new Scanner(System.in);
// int value=scanner.nextInt();
int count = 0;
long sum = 0;
for (int i = 2; i <= MAX_VALUE; i++)
{
if (isPrime(i))
{
sum += i;
count++;
if (count == num)
{
break;
}
}
}
return sum;
}
public static void main(String[] args)
{
Scanner scanner=new Scanner(System.in);
int num=scanner.nextInt();
System.out.println(new TestPrimeSum().getSum(num));
}
}
import java.util.Scanner;
public class TestPrimeSum
{
static final long MAX_VALUE = 20000000l;
public boolean isPrime(int value)
{
for (int i = 2; i <= (int) Math.sqrt(value); i++)
{
if (value % i == 0) { return false; }
}
return true;
}
public long getSum(int num)
{
// Scanner scanner=new Scanner(System.in);
// int value=scanner.nextInt();
int count = 0;
long sum = 0;
for (int i = 2; i <= MAX_VALUE; i++)
{
if (isPrime(i))
{
sum += i;
count++;
if (count == num)
{
break;
}
}
}
return sum;
}
public static void main(String[] args)
{
Scanner scanner=new Scanner(System.in);
int num=scanner.nextInt();
System.out.println(new TestPrimeSum().getSum(num));
}
}