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.
import math
mod=1000000007
def power(a,b):
    res=1
    b=b%(mod-1)
    while(b>0):
        if b%2!=0:
            res=((res%mod)*(a%mod))%mod
        b=b//2
        a=a%mod
        a=(a*a)%mod
    res=res%mod
    return res
#n=int(input())
#a=[int(i) for i in input().split()]
#c=[[0 for x in range(1001)] for y in range(1001)]
#n,q=[int(i) for i in input().split()]
#a.sort(reverse=True)
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
if a[0]==a[2*n-1]:
    print("-1")
else:
    for i in range(2*n):
        print(a[i],end=" ")