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.
# -*- coding: utf-8 -*-
"""
Created on Wed Dec 25 20:23:17 2019

@author: PC
"""

def reordering(L):
    
    m = len(L)
    
    for i in range(m-1):
        if L[i] != L[i+1]:
            break
    else:
        return -1
        
    Sum1 = 0
    Sum2 = 0
    
    for i in range(m//2):
        Sum1 += L[i]
    for j in range(m//2, m):
        Sum2 += L[j]
    
    if Sum1 != Sum2:
        return L
    
    L.sort()
    return L

t = int(input())
arr = list(map(int, input().split())) 
X = reordering(arr)

if X != -1:
    for x in X:
        print(x, end = " ")
else:
    print(X)
    
    
    
    
        