Hungry Sequence

1000ms

262144K

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:

Sample Output:

2 9 15

Sample Input:

Sample Output:

11 14 20 27 31

Informação

Provedor Codeforces

Código CF327B