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

 题意：给你一个n，

你列出来n个数字，这n个数字从小到大，而且相互之间不能互余。

当N足够大的时候，列举相邻的几个数，则他们相互之间没有可以互余的，而且是递增的。

#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define N 1050000
int main()
{
    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;
}