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())
l=list(map(int,input().split()))
n1=n

l.sort(reverse=True)
l1=l[:n1]
l2=l[n1:]
if(sum(l1)==sum(l2)):
	print(-1)
else:
	for i in l:
		print(i,end=' ')
	print()
	

'''#print(l1,l2)
if(sum(l1)!=sum(l2)):
	for i in l:
		print(i,end=' ')
	print()
else:
	i=n1-1
	j=n-1
	while(i>=0 and j>=0 and sum(l1)==sum(l2)):
		temp=l1[i]
		l1[i]=l2[j]
		l2[j]=temp
		i=i-1
		j=j-1
	
	if(sum(l1)==sum(l2)):
		print(-1)
	else:
		l3=l1+l2
		for k in l3:
			print(k,end=' ')
		print()'''