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 call(n,a,flag,x,y):
	for i in range(n):
		for j in range(n,2*n):
			if x-a[i]+a[j]!=y+a[i]-a[j]:
				a[i],a[j]=a[j],a[i]
				for val in a:
					print(val, end=" ")
				print()
				flag=True
				return
	if flag==False:
		print(-1)

n=int(input())
a=list(map(int,input().split()))
x=sum(a[0:n])
y=sum(a[n:2*n])
flag=False
if x!=y:
	for val in a:
		print(val, end=" ")
	print()
	flag=True

else:
	call(n,a,flag,x,y)
	# for i in range(n):
	# 	for j in range(n,2*n):
	# 		if x-a[i]+a[j]!=y+a[i]-a[j]:
	# 			a[i],a[j]=a[j],a[i]
	# 			for val in a:
	# 				print(val, end=" ")
	# 			print()
	# 			flag=True
	# 		break
	# if flag==False:
	# 	print(-1)



