Petya and His Friends

2000ms

262144K

Description:

Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals to n.

Let us remind you the definition of the greatest common divisor: GCD(a₁, ..., a_k) = d, where d represents such a maximal positive number that each a_i (1 ≤ i ≤ k) is evenly divisible by d. At that, we assume that all a_i's are greater than zero.

Knowing that Petya is keen on programming, his friends has agreed beforehand that the 1-st friend gives a₁ sweets, the 2-nd one gives a₂ sweets, ..., the n-th one gives a_n sweets. At the same time, for any i and j (1 ≤ i, j ≤ n) they want the GCD(a_i, a_j) not to be equal to 1. However, they also want the following condition to be satisfied: GCD(a₁, a₂, ..., a_n) = 1. One more: all the a_i should be distinct.

Help the friends to choose the suitable numbers a₁, ..., a_n.

Input:

The first line contains an integer n (2 ≤ n ≤ 50).

Output:

If there is no answer, print "-1" without quotes. Otherwise print a set of n distinct positive numbers a₁, a₂, ..., a_n. Each line must contain one number. Each number must consist of not more than 100 digits, and must not contain any leading zeros. If there are several solutions to that problem, print any of them.

Do not forget, please, that all of the following conditions must be true:

For every i and j (1 ≤ i, j ≤ n): GCD(a_i, a_j) ≠ 1
GCD(a₁, a₂, ..., a_n) = 1
For every i and j (1 ≤ i, j ≤ n, i ≠ j): a_i ≠ a_j

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Sample Input:

Sample Output:

99
55
11115

Sample Input:

Sample Output:

Informação

Provedor Codeforces

Código CF66D