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.
//https://codeforces.com/problemset/problem/1174/A
import java.util.ArrayList;
import java.util.Scanner;

public class Problem_1174_A {
    private static Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {

        int n = scanner.nextInt();
        ArrayList<Integer> list = new ArrayList<>();
        ArrayList<Integer> list2 = new ArrayList<>();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        int sum1 = 0;
        int sum2 = 0;

        for (int i=0; i<n; i++){
           int temp = scanner.nextInt();
            list.add(temp);
            min = Math.min(min, temp);
            sum1 += temp;
        }

        for (int i=0; i<n; i++){
            int temp = scanner.nextInt();
            list2.add(temp);
            max = Math.max(max, temp);
            sum2 += temp;
        }

        if (min == max)
            System.out.println(-1);
        else if (sum1 != sum2){
            for (int i=0; i<n; i++){
                System.out.print(list.get(i) + " ");
            }

            for (int i=0; i<n; i++){
                System.out.print(list2.get(i) + " ");
            }
        }
        else {
            int index1 = list.indexOf(min);
            int index2 = list2.indexOf(max);
            int temp = list.get(index1);
            list.set(index1, list2.get(index2));
            list2.set(index2, temp);

            for (int i=0; i<n; i++){
                System.out.print(list.get(i) + " ");
            }

            for (int i=0; i<n; i++){
                System.out.print(list2.get(i) + " ");
            }

        }




        scanner.close();
    }
}
