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.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer;
import java.util.Arrays; 
public class poralis
{ 
   static class FastReader 
   { 
      BufferedReader br; 
      StringTokenizer st; 
   
      public FastReader() 
      { 
         br = new BufferedReader(new
                     InputStreamReader(System.in)); 
      } 
   
      String next() 
      { 
         while (st == null || !st.hasMoreElements()) 
         { 
            try
            { 
               st = new StringTokenizer(br.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 str = ""; 
         try
         { 
            str = br.readLine(); 
         } 
         catch (IOException e) 
         { 
            e.printStackTrace(); 
         } 
         return str; 
      } 
   }
   public static void main(String[]args)
   { 
      FastReader sc=new FastReader();
      int n=sc.nextInt();
      int a[]=new int[(2*n)];
      int i=0;
      while(i<(2*n)){
         a[i]=sc.nextInt();
         i++;
      }
      Arrays.sort(a);
      i=0;
      int sum1=0;
      int sum2=0;
      while(i<n){
         sum1+=a[i];
         i++;
      }
      while(i<(2*n)){
         sum2+=a[i];
         i++;
      }
      if(sum1==sum2){
         System.out.println("-1");
      }
      else{
         i=0;
         while(i<(2*n)){
            System.out.print(a[i]+" ");
            i++;
         }
      }
   }
}