CF364C.Beautiful Set

We'll call a set of positive integers a beautiful if the following condition fulfills: for any prime p, if , then . In other words, if one number from the set is divisible by prime p, then at least half of numbers from the set is divisible by p.

Your task is to find any beautiful set, where the number of elements is equal to k and each element doesn't exceed 2_k_2.

我们将称一个正整数集合 $ a $ 是优美的，如果满足如下条件：对任意素数 $ p $，若
，
则必有
。
换言之，若集合中有一个数能被素数 $ p $ 整除，则该集合中至少有一半的数都能被 $ p $ 整除。

你的任务是构造一个大小为 $ k $ 的优美集合，且其中每个元素均不超过 $ 2k^2 $。

The first line contains integer k (10 ≤ k ≤ 5000) that shows how many numbers the required beautiful set should have.

第一行包含一个整数 $k$（$10 \le k \le 5000$），表示所求的优美集合应包含的数字个数。

In the first line print k space-separated integers that are a beautiful set. If there are multiple such sets, you are allowed to print any of them.

在第一行输出 k 个由空格分隔的整数，构成一个优美的集合。如果存在多个这样的集合，你可以输出其中任意一个。