#P1174A. Ehab Fails to Be Thanos

    ID: 2470 Type: RemoteJudge 1000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>constructive algorithmsgreedysortings*1000

Ehab Fails to Be Thanos

No submission language available for this problem.

Description

You're given an array aa of length 2n2n. Is it possible to reorder it in such way so that the sum of the first nn elements isn't equal to the sum of the last nn elements?

The first line contains an integer nn (1n10001 \le n \le 1000), where 2n2n is the number of elements in the array aa.

The second line contains 2n2n space-separated integers a1a_1, a2a_2, \ldots, a2na_{2n} (1ai1061 \le a_i \le 10^6) — the elements of the array aa.

If there's no solution, print "-1" (without quotes). Otherwise, print a single line containing 2n2n space-separated integers. They must form a reordering of aa. You are allowed to not change the order.

Input

The first line contains an integer nn (1n10001 \le n \le 1000), where 2n2n is the number of elements in the array aa.

The second line contains 2n2n space-separated integers a1a_1, a2a_2, \ldots, a2na_{2n} (1ai1061 \le a_i \le 10^6) — the elements of the array aa.

Output

If there's no solution, print "-1" (without quotes). Otherwise, print a single line containing 2n2n space-separated integers. They must form a reordering of aa. You are allowed to not change the order.

Samples

Sample Input 1

3
1 2 2 1 3 1

Sample Output 1

2 1 3 1 1 2

Sample Input 2

1
1 1

Sample Output 2

-1

Note

In the first example, the first nn elements have sum 2+1+3=62+1+3=6 while the last nn elements have sum 1+1+2=41+1+2=4. The sums aren't equal.

In the second example, there's no solution.