Problem Statement

For an integer sequence $A$, you may perform the following operations any number of times, possibly $0$.

• Choose $2$ distinct elements $x, y$ of $A$ (as long as they are different elements, the values of $x$ and $y$ may be equal). Remove one each of $x$ and $y$ from $A$, and append one $x + y$ to the end of $A$.
• Choose $2$ distinct elements $x, y$ of $A$ (as long as they are different elements, the values of $x$ and $y$ may be equal). Remove one each of $x$ and $y$ from $A$, and append one $x - y$ to the end of $A$.

Find one integer sequence $A$ that satisfies all of the following conditions. It is guaranteed that such an $A$ exists.

• The length of $A$ is $9$.
• $1 \leq A_i \leq 9000(1 \leq i \leq 9)$
• For every integer $x$ satisfying $1 \leq x \leq 9000$, there exists a way of performing operations on $A$ such that $x$ is contained among the elements of $A$ afterwards.

Input

No input is given.

Output

Output in the following format. Here, each $A_i$ must be an integer satisfying $1 \leq A_i \leq 9000$.

$A_1$ $A_2$ $A_3$ $A_4$ $A_5$ $A_6$ $A_7$ $A_8$ $A_9$

Sample

1 2 14 2013 5 26 2013 8 12