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.Arrays;
import java.util.Scanner;

public class Main {
	public static int N;
	public static long[] a;

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		N = s.nextInt();
		a = new long[N * 2];
		for (int i = 0; i < N * 2; i++) {
			a[i] = s.nextLong();
		}
		Arrays.sort(a);
		long sum1 = 0;
		long sum2 = 0;
		for (int i = 0; i < N; i++) {
			sum1 += a[i];
		}
		for (int i = N; i < N * 2; i++) {
			sum2 += a[i];
		}
		if (sum1 == sum2) {
			System.out.println(-1);
		} else {
			for (long i : a) {
				System.out.print(i + " ");
			}
		}
	}

	public static void printArray(int[] array) {
		for (int i : array) {
			System.out.print(i + " ");
		}
		System.out.println();
	}

	public static void printMatrix(int[][] matrix) {
		for (int[] is : matrix) {
			printArray(is);
		}
		System.out.println();
	}

	public static void printArray(long[] array) {
		for (long i : array) {
			System.out.print(i + " ");
		}
		System.out.println();
	}

	public static void printMatrix(long[][] matrix) {
		for (long[] is : matrix) {
			printArray(is);
		}
		System.out.println();
	}
}