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


public class q24
{

	public static void main (String[] args) throws java.lang.Exception
	{

		FastReader scan=new FastReader();
		int n=scan.nextInt();
		long a[]=new long[2*n];
		for(int i=0;i<2*n;i++) a[i]=scan.nextLong();
		Arrays.sort(a);
		int l=0,r=a.length-1;
		long sum1=0,sum2=0;
		while(l<r){
			sum1+=a[l];
			sum2+=a[r];
			l++;
			r--;
		}
		
		if(sum1==sum2) System.out.println(-1);
		else{
			for(Long e:a){
				System.out.print(e+" ");
			}
		}
	}

		 static class FastReader{
	          BufferedReader in;
	          StringTokenizer st;
	          public FastReader(){
	              in=new BufferedReader(new InputStreamReader(System.in));
	          }
	          String next(){
	              while(st==null || !st.hasMoreElements()){
	                  try{
	                      st=new StringTokenizer(in.readLine());
	                  }
	                  catch(IOException e){
	                      e.printStackTrace();
	                  }
	               }
	               return st.nextToken();
	            }
	            int nextInt(){
	                return Integer.parseInt(next());
	            }
	            long nextLong(){
	                return Long.parseLong(next());
	            }
	            double nextDouble(){
	                return Double.parseDouble(next());
	            }
	            String nextLine(){
	            String str19 = "";
	            try{
	                str19 = in.readLine();
	            }
	            catch (IOException e){
	                e.printStackTrace();
	             }
	            return str19;
	        }
	      }
	}
