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 swap(ls, a, b):
    c = ls[a]
    ls[a]=ls[b]
    ls[b]=c


def A_Ehab_Fails_to_Be_Thanos(num: int):
    right_max_index = num
    right_min_index = num
    left_max_index = 0
    left_min_index = 0
    total1 = 0
    total2 = 0
    length = 2 * num
    i = 0
    d_list = input().split(" ")
    while i < length:

        if i < num:
            if int(d_list[left_min_index]) > int(d_list[i]):
                left_min_index = i
            if int(d_list[left_max_index]) < int(d_list[i]):
                left_max_index = i
            total1 += int(d_list[i])
        else:
            if int(d_list[right_min_index]) > int(d_list[i]):
                right_min_index = i
            if int(d_list[right_max_index]) < int(d_list[i]):
                right_max_index = i
            total2 += int(d_list[i])

        i += 1

    if total1 != total2:
        for i in d_list:
            print(i, end=" ")
        return
    if int(d_list[left_max_index]) == int(d_list[left_min_index]) == int(d_list[right_max_index]) == int(d_list[right_min_index]):
        print(-1)
        return
    elif int(d_list[left_min_index]) != int(d_list[right_min_index]):
        swap(d_list, left_min_index, right_min_index)
    elif int(d_list[left_max_index]) != int(d_list[right_max_index]):
        swap(d_list, left_max_index, right_max_index)
    elif int(d_list[left_max_index]) != int(d_list[right_min_index]):
        swap(d_list,left_max_index,right_min_index)
    elif int(d_list[left_min_index]) != int(d_list[right_max_index]):
        swap(d_list,left_min_index, right_max_index)
    for i in d_list:
        print(i, end=" ")


A_Ehab_Fails_to_Be_Thanos(int(input()))