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/contest/1174/problem/A


import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class EhabFailstoBeThanos {
	
	public static void swap(int arr[], int a, int b) {
		//System.out.println("abc");
		int temp = arr[a];
		arr[a] =arr[b];
		arr[b] = temp;
	}
	
	public static int reOrderdArray(int[] arr, int n){
		
		boolean flag = true;
		int count =0;
		int maxIndex = 0, minIndex = 0;
		for(int i = 1; i<2*n ; i++) {
			if(arr[i] == arr[i-1]) {
				count++;
			}
		}
		if(count == 2*n - 1) {
			flag = false;
		}
		if(flag == false) {
			return -1;
		}
//		int min = Integer.MAX_VALUE;
//		for(int i =0; i<n; i++) {
//			if(arr[i]< arr[minIndex]) {
//				minIndex = i;
//			}
//		}
//		
//		int max  = Integer.MIN_VALUE;
//		for(int i = n; i < 2*n; i++) {
//			if(arr[i] > arr[maxIndex]) {
//				maxIndex = i;
//			}
//		}
//		swap(arr, minIndex,maxIndex);
		
		Arrays.sort(arr);
		return 1;
	
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		
		
		int [] arr = new int[2*n];
		
		for(int i = 0; i<2*n; i++) {
			arr[i] = in.nextInt();
		}
		int result = reOrderdArray(arr, n);
		if(result == 1) {
			for(int i =0; i<2*n; i++) {
				System.out.println(arr[i]);
			}
		}
		else {
			System.out.println("-1");
		}
		
		in.close();
	}

}
