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.io.*;
public class java2{
    BufferedReader asas;
    static StringTokenizer st;
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    public static void main(String args[])throws IOException{
        
        int n=ni()*2;
        int a[]=new int[n];
        for(int i=0;i<n;i++)
        {
            a[i]=ni();
        }
        Arrays.sort(a);
        int sum1=0,sum2=0;
        for(int i=0;i<(n/2);i++)
        {
            sum1+=a[i];
        }
        for(int i=n-1;i>=(n/2);i--)
        {
            sum2+=a[i];
        }
        if(sum1==sum2) System.out.println("-1");
        else
        {
            for(int i=0;i<n;i++)
            {
                System.out.print(a[i]+" ");
            }
            System.out.println();
        }
        
        
        
        
        
    }
    static long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    static int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    
    static int ni()throws IOException{return Integer.parseInt(next());}
    static long nl()throws IOException{return Long.parseLong(next());}
    static double nd()throws IOException{return Double.parseDouble(next());}
    static String n()throws IOException{return next();}//------------------------------------>WORD
    static String nln()throws IOException{return nextLine();}//------------------------------------>LINE
    
    static String next() throws IOException{
        while (st == null || !st.hasMoreElements()){
            try{
                st = new StringTokenizer(br.readLine());
            }catch (IOException  e){
                throw new IOException(e.toString());
            }
        }
        return st.nextToken();
    }
    static String nextLine() throws IOException{
        String str = "";
        try{   
            str = br.readLine();
        }catch (IOException e){
            throw new IOException(e.toString());
        }  
        return str;
    }
    
}