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

public class xyz{

  static class FastReader{
    BufferedReader br;
    StringTokenizer st;
    FastReader(){
      br=new BufferedReader(new InputStreamReader(System.in));
    }
    String n(){
      while(st==null || !st.hasMoreElements()){
          try{
            st=new StringTokenizer(br.readLine());
          }
          catch(Exception e){
            e.printStackTrace();
          }
      }
      return st.nextToken();
    }

    String nline(){
      String str="";
      try{
        str=br.readLine();
      }
      catch(Exception e){
        e.printStackTrace();
      }
      return str;
    }
    int ni(){
      return Integer.parseInt(n());
    }
    long nl(){
      return Long.parseLong(n());
    }
    double nd(){
      return Double.parseDouble(n());
    }
  }

  public static void main (String args[]) throws IOException{
    FastReader in=new FastReader();
    BufferedOutputStream out=new BufferedOutputStream(System.out);
    StringBuilder sb = new StringBuilder(),sb1 = new StringBuilder();

    int i=0,j;
    int n=in.ni();
    n*=2;
    int []a=new int[n];
    Set<Integer>set=new HashSet<Integer>();
    while(n-->0){ set.add(a[i++]=in.ni());}
    if(set.size()==1) sb.append("-1");
    else{
      Arrays.sort(a);
      for(i=0;i<a.length;i++) sb.append(a[i]+" ");
    }
    sb.append("\n");
    out.write(sb.toString().getBytes());
    out.flush();
  }
}
