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.
import java.util.*;


public class CP {

    static int[] arr1 = new int[2000], arr2 = new int[2000];
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int fhalf = 0, shalf = 0;
        for(int i=1;i<=n;i++) {
            int foo = scanner.nextInt();
            fhalf += foo;
            arr1[i] = foo;
        }
        for(int i=1;i<=n;i++) {
            int foo = scanner.nextInt();
            shalf += foo;
            arr2[i] = foo;
        }
        boolean ok = true;
        if(shalf - fhalf == 0) {
            for(int i = 1; i<=n; i++) {
                for(int j = 1; j<=n; j++) {
                    if(arr1[i] != arr2[j] && ok == true) {
                        ok = false;
                        int foo = arr1[i];
                        arr1[i] = arr2[j];
                        arr2[j] = foo;
                    }
                }
            }
        } else {
            ok = false;
        }
        if(ok == false){
            for(int i = 1; i<=n; i++) System.out.print(arr1[i] + " ");
            for(int i = 1; i<=n; i++) System.out.print(arr2[i] + " ");
        } else {
            System.out.println("-1");
        }
    }


}

