No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Beautiful Set

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputWe'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}.

Input

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

Output

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.

Examples

Input

10

Output

16 18 24 27 36 48 54 72 108 144

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/12/2021 05:58:27 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|