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.
if __name__=="__main__":
# Write the main function here
    n=int(input())
    # accept the array
    ar=list(map(int,input().split()))
    # SOrt the first part
    first=ar[0:n]
    second=ar[n:]
    # print(first,second)
    setA=set(first)
    setB=set(second)
    # print(setA,setB)
    listA=list(setA)
    listB=list(setB)
    # print(listA[0])
    if len(listA)==1 and len(listB)==1 and listA[0]==listB[0]:
        print(-1)
    else:
        # Check whether the sum of first and second are same
        if sum(first)!=sum(second):
            new=first+second
        # print(new)
            for i in new:
                print(i,end=" ")
        # Find two different numbers and swap in the new array
        else:
            first.sort()
            second.sort()
            # print(first,second)
            for i in range(n):
                # print(i,n-i-1)
                if first[i]!=second[n-i-1]:
                    # Swap them
                    first[i],second[n-i-1]=second[n-i-1],first[i]
                    break
            new=first+second
            # print(new)
            for i in new:
                print(i,end=" ")
