Coco, who loves chocolate and playing with numbers, defined a "chocolate number" as follows:

• A positive integer $n > 1$ is called a chocolate number if it is divisible only by $1$ and itself.

Some time later, Coco discovered the "Coco Theorem":

• If $p$ is a chocolate number, then for every integer $a$ coprime to $p$, $a^{p-1} \operatorname{mod} p = 1$.

Coco thought of a way to determine whether a number is a chocolate number using this. The specific method is as follows:

• If for every integer $a$ coprime to $p$, $a^{p-1} \operatorname{mod} p = 1$, then $p$ is a chocolate number.

However, shortly after, Coco discovered that $561$ satisfies the condition of this test but is not a chocolate number. Coco decided to call such numbers "fake chocolate numbers" and began researching how to find them.

As a result of focusing on the research and forgetting to run the chocolate factory, Coco was able to find fake chocolate numbers that are the product of 3, 4, ..., 10 chocolate numbers, but could not find one that is the product of 11. Let's find such a fake chocolate number for Coco. Since finding just any one is not difficult, let's find a number $N$ that satisfies the following conditions:

• When written as $N = a_1 \times a_2 \times \cdots \times a_{11}$, $N$ is a fake chocolate number, and for $1 \le i \le 11$, $a_i$ is a chocolate number satisfying $10^7 \le a_i < 10^8$.

There is no input.

When the number satisfying the problem conditions is expressed as a product of 11 chocolate numbers, output those 11 chocolate numbers in ascending order on the first line.

Examples

Input 1

0

Output 1

2 3 5 7 11 13 17 19 23 29 31