#957 Unsorting a Sequence 1

Statement

Statement language

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

Rearrange the elements of $A$ to obtain a sequence that is not sorted, and print one such sequence. If no such sequence exists, print -1.

The input is given in the following format.

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

If a rearrangement that is not sorted exists, print any such sequence on one line, separated by spaces. Otherwise print -1.

#	Score	Constraints
1	10	$N\leq3$ .
2	7	All elements of $A$ are equal.
3	19	At most two distinct values occur in $A$ .
4	25	All elements of $A$ are distinct.

Sample 1

Input

3
1 1 2

Output

2 1 1

Sample 2

Input

2
-1 -1

Output

-1