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()))
k=0
for i in range(0,2*n):
    if(A[0]!=A[i]):
        k=1
        break;
if(k==0):
    print(-1)
else:
    s1=0
    s2=0
    B=list()
    C=list()
    for i in range(0,n):
        s1+=A[i]
        B.append(A[i])
    for j in range(n,2*n):
        s2+=A[j]
        C.append(A[j])
    if(s1==s2):
        r=1
        for i in range(0,n):
            if(r==0):
                break
            for j in range(0,n):
                if(B[i]!=C[j]):
                    t=B[i]
                    B[i]=C[j]
                    C[j]=t
                    r=0
                    break
        A=B+C
    print(' '.join(map(str,A)))

    