Weird Sort

You are given a sequence of $N$ integers $a_1, a_2, \dots, a_N$. Reorder them so that no element is exactly one greater than the element immediately before it. Formally, the final sequence must satisfy $a_{i+1} \neq a_i + 1$ for every $i$ with $1 \le i < N$.

If several orderings satisfy this condition, output the lexicographically smallest one.

The input consists of several data sets. Each data set spans two lines. The first line contains the sequence length $N$ ($1 \le N \le 50000$). The second line contains $N$ integers $a_1, a_2, \dots, a_N$ separated by single spaces, each satisfying $|a_i| \le 10^9$. A line containing a single $0$ marks the end of the input and is not processed.

For each data set, print the resulting sequence on its own line, with integers separated by single spaces. If no valid ordering exists, print No solution instead.