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.*;
public class Solution {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n;
		n = sc.nextInt();
		int i;
		ArrayList<Integer> A = new ArrayList<Integer>();
		//ArrayList<Integer> B = new ArrayList<Integer>();
		for(i=0;i<2*n;i++){
			A.add(sc.nextInt());
		}
		Collections.sort(A);
		int sumA=0;
		int sumB=0;
		for(i=0;i<n;i++){
			sumA += A.get(i);
			sumB += A.get(i+n);
		}
		
		if(sumA == sumB){
			System.out.print("-1");
			//System.exit(0);
		}
		else{
			for(i=0;i<2*n;i++){
				System.out.print(A.get(i)+" ");
			}
		}
		
		sc.close();

	}

}
		/*
		int sumA=0,sumB=0;
		for(i=0;i<n;i++){
			A.add(sc.nextInt());
			sumA += A.get(i);
		}
		for(i=n;i<2*n;i++){
			B.add(sc.nextInt());
			sumB += B.get(i-n);
		}
		Collections.shuffle(A);
		Collections.shuffle(B);
		if(sumA == sumB){	//This is our problem
			for(i=0;i<n;i++){
				if(A.get(i) == B.get(i)){
					if(i == (n-1)){
						System.out.println("-1 ");					
						System.exit(0);
					}
					continue;
				}
				else if(i<(n-1)){
					int temp = A.get(i);
					A.set(i, B.get(i));
					B.set(i, temp);
					break;
				}
				
			}
		}
		
		else{
			for(i=0;i<n;i++){
				System.out.print(A.get(i)+" ");
			}
			for(i=n;i<2*n;i++){
				System.out.print(B.get(i-n)+" ");
			}
		}
		for(i=0;i<n;i++){
			System.out.print(A.get(i)+" ");
		}
		for(i=n;i<2*n;i++){
			System.out.print(B.get(i-n)+" ");
		}
		*/
		
		