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.
n = int(input())
a = list(map(int, input().split()))
sum_1 = sum(a[:n])
sum_2 = sum(a[n:])
if sum_1 != sum_2:
    print(*a)
else:
    s1 = (a[:n])
    s2 = (a[n:])
    '''for i in range(n):
        if s1[i] != s2[i]:
            s1[i], s2[i] = s2[i], s1[i]
            break'''
    '''m1 = set(s1)
    m2 = set(s2)
    m = m1 ^ m2
    m = list(m)
    '''
    '''m1 = max(s1)
    m2 = min(s2)
    i1 = s1.index(m1)
    i2 = s2.index(m2)'''
    s1, s2 = sorted(s1), sorted(s2)
    s1[0], s2[-1] = s2[-1], s1[0]
    if sum(s1) == sum(s2):
        print(-1)
    else:
        s1.extend(s2)
        print(*s1)
