Loot Lake

Time limit: 1s Memory limit: 256MB Input: Output:

Task

As you are one of the top Forbnite players, you obviously remained the only one alive in Loot Lake, and because of that, you were able to find the golden chest, the most precious of all. Happy to find it, you rushed to open it, but, as the rules of Forbnite are weird, a number nn was written on the chest, and a cypher with n+1n+1 numbers was on the lock, and a message from the creators of Forbinte appeared:

You may only open the chest if the fifth power of the first number you put in the cypher is equal to the sum of the other numbers fifth powers, and all the numbers you write are distinct.

As you want the best loot, you have to solve this problem.

Input data

The first (and only) line contains a single positive integer n,(4n300)n, (4 \le n \le 300).

Output data

Print n+1n+1 distinct positive integers, x0,x1,...,xn,(1xi150300)x_0,x_1,...,x_n, (1\le x_i \le 150^{300}) such that x05=i=1nxi5x_0^{5}=\sum_{i=1}^{n}x_i^{5}.

Example

stdin

4

stdout

144 133 110 84 27 

Log in or sign up to be able to send submissions!