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()))
a_1=a[0:n]
a_2=a[n:2*n]
if(sum(a_1)!=sum(a_2)):
    for item in a:
        print (item , end=" ")
else:
    if(max(a_1)==min(a_1) and max(a_2)==min(a_2)):
        print("-1")
    else:
        flag=0
        for i in range(0,len(a_1)):
            for j in range(0,len(a_2)):
                if(a_1[i]!=a_2[j]):
                    temp=a_1[i]
                    a_1[i]=a_2[j]
                    a_2[j]=temp
                    flag=1
                    break
            if(flag==1):
                break
        for item in a_1:
            print (item,end=" ")
        for item in a_2:
            print (item,end=" ")