Sorting a Sequence 1

A sequence $A$ of length $N$ is sorted if $A_i \leq A_{i+1}$ for every $1 \leq i < N$.

There is exactly one sorted sequence that can be obtained by rearranging the elements of $A$. Print this sequence.

The input is given in the following format.

$N$ $A_1\ A_2\ \cdots\ A_N$

Print the sorted sequence on one line, separated by spaces.

• $1 \leq N \leq 3$.
• $-10^9\leq A_i\leq10^9$ ().