Problem Statement

Print a sequence $a_1, a_2, ..., a_N$ whose length is $N$ that satisfies the following conditions:

• $a_i$ $(1 \leq i \leq N)$ is a prime number at most $55$ $555$.
• The values of $a_1, a_2, ..., a_N$ are all different.
• In every choice of five different integers from $a_1, a_2, ..., a_N$, the sum of those integers is a composite number.

If there are multiple such sequences, printing any of them is accepted.

Note

An integer $N$ not less than $2$ is called a prime number if it cannot be divided evenly by any integers except $1$ and $N$, and called a composite number otherwise.

Constraints

• $N$ is an integer between $5$ and $55$ (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print $N$ numbers $a_1, a_2, a_3, ..., a_N$ in a line, with spaces in between.