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.
def gns():
    return [int(x) for x in input().split()]
n=int(input())
ns=gns()
sm=sum(ns)
if sm%2==1:
    for c in ns:
        print(c,end=' ')
    print()
    quit()
s1=0
i=0
while i<2*n:
    if ns[i]!=ns[0]:
        break
    i+=1
if i==2*n:
    print(-1)
    quit()
s2=i
ans=[]
j=0
while len(ans)<n-1:
    if j!=s1 and j!=s2:
        ans.append(ns[j])
    j+=1
if sum(ans)+ns[s1]==sm//2:
    ans.append(ns[s2])
    ans.append(ns[s1])
else:
    ans.append(ns[s1])
    ans.append(ns[s2])
while len(ans)<n*2:
    if j!=s1 and j!=s2:
        ans.append(ns[j])
    j+=1
for c in ans:
    print(c,end=' ')
print()
