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


public class EhabFailstoBeThanos {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt()*2;

		ArrayList<Integer> fh = new ArrayList<Integer>();
		ArrayList<Integer> sh = new ArrayList<Integer>();
		int a[] = new int[n];
		int f = 0,s=0;
		
		for(int i=0;i<n;i++) {
			int val = sc.nextInt();
			if(i<n/2) {
				f+=val;
				fh.add(val);
			}else {
				s+=val;
				sh.add(val);
			}
			a[i] = val;
		}

		
		if(f!=s) {
			for(int k=0;k<n-1;k++) {
				System.out.print(a[k]+" ");
			}
			System.out.println(a[n-1]);
			System.exit(0);
		}else {
			for(int i=0;i<n/2;i++) {
				for(int j=n/2;j<n;j++) {
					if(a[i]!=a[j]) {
						int temp = a[i];
						a[i] = a[j];
						a[j] = temp;
						
						for(int k=0;k<n-1;k++) {
							System.out.print(a[k]+" ");
						}
						System.out.println(a[n-1]);
						System.exit(0);
					}
				}
			}
		}
		
		System.out.print(-1);
				
	}

}
