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

public class Thanos{

    static int[]strToIntArr(String s){
	//	s = s.substring(1,s.length()-1);
	String[] sArr = s.split(" ");
	int len = sArr.length;
	int[] retArr = new int[len];
	for(int i=0;i<len;i++){
	    retArr[i] = Integer.parseInt(sArr[i]);
	}
	return retArr;
    }

    int[]reord(int n, int[]arr){
	Arrays.sort(arr);
	int[]retArr = arr;
	int firstSum = 0;
	int lastSum = 0;
	for(int i=0;i<n;i++){
	    firstSum += arr[i];
	    lastSum += arr[2*n-1-i];
	}
	if(firstSum==lastSum){
	    retArr = new int[]{-1};
	}
	return retArr;
    }

    
    public static void main(String[]args) throws Exception{
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
	Thanos th = new Thanos();
	String nLn = br.readLine();
	String arrLn = br.readLine();
	int n = Integer.parseInt(nLn);
	int[]arr = strToIntArr(arrLn);
	int[]reArr = th.reord(n,arr);
	for(int i=0;i<reArr.length;i++){
	    bw.write(Integer.toString(reArr[i]));
	    if(i<(arr.length-1)){
		bw.write(" ");
	    }
	}
	bw.newLine();
	bw.flush();
    }
}
