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.Scanner;

public class Ehab {

   public static void main(String[] args) {
        Scanner sc =new Scanner(System.in);
        int len = sc.nextInt ();
        len=len*2;
        int sum1=0;
        int sum2=0;
        int[] a =new int[len];
        for (int i = 0; i <len; i++) {
            a[i]=sc.nextInt ();
            if(i<len/2)sum1+=a[i];
            else sum2+=a[i];
        }
        if(sum1!=sum2){
            for (int i = 0; i <len; i++) {
                System.out.print(a[i]+" ");
            }
        }else{
        	boolean min=true;
        	boolean con=true;
            for (int i = 0; i < len/2&&con; i++) {
                for (int j = 0; j <len/2; j++) {
                    if(a[i]!=a[len/2+j]){
                        int temp=a[i];
                        a[i]=a[len/2+j];
                        a[len/2+j]=temp;
                        min=false;
                        con=false;
                        break;
                    }
                }
            }if(min)System.out.print("-1");else
            for (int i = 0; i <len; i++) {
                System.out.print(a[i]+" ");
            }
        }

    }
}
