Gluttony

2000ms

262144K

Description:

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₁, x₂, ..., x_k} (1 ≤ x_i ≤ n, 0 < k < n) the sums of elements on that positions in a and b are different, i. e.

$\text{[math]}$

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₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹) — 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₁, b₂, ..., b_n. Note that b must be a permutation of a.

If there are multiple answers, print any of them.

Sample Input:

2
1 2

Sample Output:

2 1

Sample Input:

4
1000 100 10 1

Sample Output:

100 1 1000 10

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.

Informação

Provedor Codeforces

Código CF891B