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

import java.util.Scanner;

public class Solution {

	public static void main(String[] args) {
		Scanner read = new Scanner(System.in);
		
		int n = read.nextInt();
		
		int[] firstPart = new int[n];
		int[] secondPart = new int[n];
		
		int firstSum = 0;
		for (int i = 0; i < n; ++i) {
			firstPart[i] = read.nextInt();
			firstSum += firstPart[i];
		}
		
		int secondSum = 0;
		for (int i = 0; i < n; ++i) {
			secondPart[i] = read.nextInt();
			secondSum += secondPart[i];
		}
		
		if (firstSum != secondSum) {
			for (int i = 0; i < n; ++i) { 
				System.out.print(firstPart[i] + " "); 
			};
			for (int i = 0; i < n; ++i) { 
				System.out.print(secondPart[i] + " "); 
			};
		}
		else {
			boolean swapped = false;
			for (int i = 0; i < n; ++i) {
				for (int j = 0; j < n; ++j) {
					if (firstPart[i] != secondPart[j]) {
						int temp = firstPart[i];
						firstPart[i] = secondPart[j];
						secondPart[j] = temp;
						swapped = true;
						break;
					}
				}
				if (swapped) {
					break;
				}
			}
			
			if (!swapped) {
				System.out.println("-1");
			}
			else {
				for (int i = 0; i < n; ++i) { 
					System.out.print(firstPart[i] + " "); 
				};
				for (int i = 0; i < n; ++i) { 
					System.out.print(secondPart[i] + " "); 
				};
			}
		}
	
		// Close scanner
		read.close();
	}

}