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.Scanner;
import java.util.Arrays;
public class p_138 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int A[] = new int[n*2];
        for (int i = 0; i < 2 * n; i++) {
            A[i] = sc.nextInt();
        }
        
        int X[] = new int[n];
        int Y[] = new int[n];

        int sum_x = 0;
        int sum_y = 0;
        for (int i = 0; i < n; i++) {
            X[i] = A[i];
            sum_x += X[i];
        }
        int j_1=0;
        for (int i = n; i < 2*n; i++) {
            Y[j_1] = A[i];
            sum_y += Y[j_1];
            j_1++;
        }
        
        if (sum_x != sum_y) {
            for (int i = 0; i < 2 * n; i++) {
                System.out.print(A[i]+" ");
            }
        } else {
            int flage = 0;
            for (int i = 0; i < 2 * n - 1; i++) {
                if (A[i] != A[i + 1]) {
                    flage = 1;
                    break;
                } else {
                    flage = 0;
                }
            }
            
            if (flage == 0) {
                System.out.println(-1);
            } else {
                Arrays.sort(X);
                Arrays.sort(Y);
                int i = n-1;
                int j = n-1;
                while (true) {
                    if (X[i] == Y[j]) {
                        j--;
                    } else {
                        break;
                    }
                }
                int temp = X[i];
                X[i] = Y[j];
                Y[j] = temp;

                if (j < 0) {
                    System.out.println(-1);
                } else {
                    for (int z = 0; z < n; z++) {
                        System.out.print(X[z]+" ");
                    }
                    for (int z = 0; z < n; z++) {
                        System.out.print(Y[z]+" ");
                    }
                }
            }
        }
        sc.close();
    }
}
