cf div2 191 b

B. Hungry Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

3

output

2 9 15

input

5

output

11 14 20 27 31

先来发一篇没啥质量的cf水题，下面是代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

long long a[100000];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
          int count=1;
          int i=n+1;
          while(1){
               a[count]=i;
               i++;
               count++;
               if(count==n+1)
                 break;
          }
          for(int j=1;j<=n;j++)
              printf("%lld ",a[j]);
          printf("\n");
    }
}