CodeForces 327B 水题。

I - 9

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 327B

Description

Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of n integers.

A sequence a₁, a₂, ..., a_n, consisting of n integers, is Hungry if and only if:

• Its elements are in increasing order. That is an inequality a_i < a_j holds for any two indices i, j (i < j).
• For any two indices i and j (i < j), a_j must not be divisible by a_i.

Iahub is in trouble, so he asks you for help. Find a Hungry sequence with n elements.

Input

The input contains a single integer: n (1 ≤ n ≤ 10⁵).

Output

Output a line that contains n space-separated integers a₁ a₂, ..., a_n (1 ≤ a_i ≤ 10⁷), representing a possible Hungry sequence. Note, that each a_i must not be greater than 10000000 (10⁷) and less than 1.

If there are multiple solutions you can output any one.

Sample Input

Input

3

Output

2 9 15

Input

5

Output

11 14 20 27 31

思路：本来想打素数表， 但不能超过十的七次方应该就是卡素数吧， 直接把数让他从最大开始然后需要多少连续输出多少，最多十的五次方个数， 但最大十的七次方， 这中间肯定不会出现整除的。


代码：

#include<stdio.h>
#include<string.h>
#include<math.h>

#define N 10000000

int main(void)
{
int i, n;
while(scanf("%d", &n) != EOF)
{
for(i = N - n + 1; i <= N; i++)
{
if(i == N)
printf("%d ", i);
else
{
printf("%d ", i);
}
}
}

return 0;
}