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

public class Main {
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int [] array = new int[2*n];
		for (int i = 0; i < 2*n; i++) {
			array[i] = in.nextInt();
		}
		
		boolean found1 = false;
		boolean found2 = false;
		
		int sum1 = 0;
		int sum2 = 0;
		
		for(int i = 0; i < n; i++) {
			sum1 += array[i];
		}
		
		for(int i = n; i < 2*n; i++) {
			sum2 += array[i];
		}
		
		int j = 0;
		int k = 2*n-1;
		
		while (found1 == false && found2 == false && j < k && sum1 == sum2) {
			if (array[0] != array[k]) {
				found1 = true;
			}
			else if (array[0] != array[j]) {
				found2 = true;
			} else {
				j++;
				k--;
			}
		}
		
		if (found1 == true && sum1 == sum2) {
			int temp = array[0];
			array[0] = array[k];
			array[k] = temp;
		}
		
		if (found2 == true && sum1 == sum2) {
			int temp = array[j];
			array[j] = array[k];
			array[k] = temp;
		}
		
		if (found1 == false && found2 == false && sum1 == sum2) {
			System.out.println(-1);
		}
		else {
			for(int i = 0; i < 2*n; i++) {
				if(i == 2*n-1) {
					System.out.print(array[i] + "\n");
				}
				else {
				System.out.print(array[i] + " ");
				}
			}
		}
	}
}

	   	 	 	  	 	  		 	 	  			 		