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.io.*;

public class A563 {
    public static void main(String[] args) throws IOException {

        BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        String s1 = inp.readLine();
        int size = Integer.parseInt(s1);
        String[] s2 = inp.readLine().split(" ");
        int[] given = new int[2*size];
        int multi = 2*size;
        for(int i=0;i<multi;i++){
            given[i] = Integer.parseInt(s2[i]);
        }
        int left = 0;
        int right = 0;
        int leftSum = 0;
        int rightSum = 0;
        int positionl = -1;
        int positionr = -1;

        for(int i=0;i<size;i++){
            left = given[i];
            right = given[multi-1-i];
            leftSum = leftSum + left;
            rightSum = rightSum + right;
        }
        if(leftSum!=rightSum){
            for(int i=0;i<multi;i++){
                out.write(given[i]+" ");
            }
        }
        else{
            int a = 0;
            int b = multi-1;
            boolean loop = true;
            while(loop){
                if(given[a]!=given[b]){
                    loop = false;
                    positionl = a;
                    positionr = b;
                }else{
                    if(a<size){
                        a++;
                    }
                    else{
                        b--;
                    }
                    if(b<size){
                        break;
                    }
                }
            }

            if(positionl>=0){
                int aa = given[positionl];
                given[positionl] = given[positionr];
                given[positionr] = aa;
                for(int i=0;i<multi;i++){
                    out.write(given[i]+" ");
                }
            }
            else{
                out.write("-1");
            }
        }
        out.flush();
    }
}
