You are given an array $*a*$ with $*n*$ distinct integers. Construct an array $*b*$ by permuting $*a*$ such that for every non-empty subset of indices $*S* = {*x*_{1}, *x*_{2}, ..., *x*_{*k*}}$ ($1 ≤ *x*_{*i*} ≤ *n*$, $0 < *k* < *n*$) the sums of elements on that positions in $*a*$ and $*b*$ are different, i. e.

Input

The first line contains one integer $*n*$ ($1 ≤ *n* ≤ 22$) — the size of the array.

The second line contains $*n*$ space-separated distinct integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ ($0 ≤ *a*_{*i*} ≤ 10^{9}$) — the elements of the array.

Output

If there is no such array $*b*$, print -1.

Otherwise in the only line print $*n*$ space-separated integers $*b*_{1}, *b*_{2}, ..., *b*_{*n*}$. Note that $*b*$ must be a permutation of $*a*$.

If there are multiple answers, print any of them.

Note

An array $*x*$ is a permutation of $*y*$, if we can shuffle elements of $*y*$ such that it will coincide with $*x*$.

Note that the empty subset and the subset containing all indices are not counted.