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

Input

The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is the number of elements in the array a.

The second line contains 2n space-separated integers a_1, a_2, …, a_{2n} (1 ≤ a_i ≤ 10^6) — the elements of the array a.

Output

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

Examples

Input


3
1 2 2 1 3 1


Output


2 1 3 1 1 2

Input


1
1 1


Output


-1

Note

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

In the second example, there's no solution.
#!/usr/bin/env python3

x = int(input())
l = input().split()
for i in range(x+x):
    l[i] = int(l[i])

can = False
for i in range(1, x+x):
    if l[i] != l[0]:
        can = True
if not can:
    print(-1)
    exit(0)

sum1, sum2 = 0, 0
for i in l[:x]:
    sum1 += i
for i in l[x:]:
    sum2 += i

fl = False
if sum1 == sum2:
    for i in range(x):
        for j in range(x, x+x):
            if l[i] != l[j]:
                l[i], l[j] = l[j], l[i]
                fl = True
                break
            if fl:
                break
        if fl:
            break

o = []
for i in l:
    o.append(str(i))
print(" ".join(o))
