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 Sample {
	
	static int product(String n, int pos){
		if(n.length() == 1) return Integer.parseInt(n);
		int result = 1;
		for(int i = 0; i < pos; i++){
			result *= Integer.parseInt(Character.toString(n.charAt(i)));
		}
		if(Integer.parseInt(Character.toString(n.charAt(pos))) != 0){
			int temp = (Integer.parseInt(Character.toString(n.charAt(pos))) - 1);
			if((pos == 0) && (temp == 0)) temp = 1;
			result = temp * result;
		}
		for(int i = (pos+1); i < n.length(); i++){
			result *= 9;
		}
		return result;
	}
	
	static int product(String n){
		int result = 1;
		for(int i = 0; i < n.length(); i++){
			result *= Integer.parseInt(Character.toString(n.charAt(i)));
		}
		return result;
	}
	
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[2*n];
		for(int i = 0; i < arr.length; i++){
			arr[i] = sc.nextInt();
		}
		Arrays.sort(arr);
		int sumLeft= 0;
		int sumRight = 0;
		for(int i = 0; i < n; i++){
			sumLeft += arr[i];
		}
		
		for(int i = n; i < arr.length; i++){
			sumRight += arr[i];
		}
		if(sumLeft == sumRight) System.out.println(-1);
		else{
			for(int i = 0; i < arr.length; i++){
				System.out.print(arr[i] + " ");
			}
		}
	}
}