L. Avoid Square Sums
time limit per test
2 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

Find a set $$$T$$$ of $$$n$$$ distinct positive integers such that:

  • All integers in $$$T$$$ are at most $$$10^5$$$.
  • There does not exist a non-empty subset $$$S$$$ of $$$T$$$ with size less than or equal to $$$8$$$ such that the sum of elements in $$$S$$$ is a perfect square.
Input

A single integer $$$n$$$ ($$$1 \le n \le 2862$$$) — the size of the set you must produce.

Output

On a single line, print $$$n$$$ distinct integers, each between $$$1$$$ and $$$10^5$$$ inclusive, satisfying the conditions above. Any valid answer will be accepted.

Example
Input
5
Output
26 70 84 90 92