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())
z=n
a=input().split()
q1=[]
q2=[]
x=0
y=1
sum1=0
sum2=0
s=[int(num)for num in a]
for i in range(0,2*n):
    if s[i]==s[i+1]:
        q=-1
        if i==(2*n)-2:
            break
    else:
        q=1
        break
if  q==-1:
    print(q)
else:
    while True:
        while not n==0:
            if s[x]>=s[y]:
                q1.append(s[x])
                q2.append(s[y])
            else:
                q1.append(s[y])
                q2.append(s[x])
            x+=2
            y+=2
            n-=1
        for i in q1:
            sum1+=i
        for i in q2:
            sum2+=i
        if sum1==sum2:
            s=q1+q2
            q1=[]
            q2=[]
            x=0
            y=1
            n=z
            continue
        else:
            break
e=q1+q2
for i in e:
    print(i,end=' ')
