Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

No tag edit access

B. Hungry Sequence

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIahub 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*_{1}, *a*_{2}, ..., *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^{5}).

Output

Output a line that contains *n* space-separated integers *a*_{1} *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{7}), representing a possible Hungry sequence. Note, that each *a*_{i} must not be greater than 10000000 (10^{7}) and less than 1.

If there are multiple solutions you can output any one.

Examples

Input

3

Output

2 9 15

Input

5

Output

11 14 20 27 31

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/06/2019 14:59:13 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|