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.math.*;
import java.util.*;
import java.io.*;
public class Main {

   void solve(){
      int n=ni();
      int a[]=new int[2*n+1];
      //HashSet<Integer> hs=new HashSet<>();
      long total=0;
      for(int i=1;i<=2*n;i++) {
         a[i]=ni();
         total+=a[i];
      }
      Arrays.sort(a,1,2*n+1);
      long sm=0;
      for(int i=1;i<=n;i++) sm+=a[i];
      if(sm==total-sm) pw.println("-1");
      else {
         for(int i=1;i<=2*n;i++) pw.print(a[i]+" ");
      }
   }
   long add(long a,long b){
      a+=b;
      if(a>=M) a-=M;
      return a;
   }
   long mul(long a,long b){
      a*=b;
      if(a>=M) a%=M;
      return a;
   }
   long sub(long a,long b){
      a-=b;
      if(a<0) a+=M;
      return a;
   }
 long modpow(long x, long y, long M){

      long res = 1;

      x = x % M;

      while (y > 0)
      {

         if((y & 1)==1)
            res = (res * x) % M;

         y = y >> 1;
         x = (x * x) % M;
      }
      return res;
   }
   long modInverse(long A,long M){
      return modpow(A,M-2,M);
   }


   long M =(long)1e9+7;


   InputStream is;
   PrintWriter pw;
   String INPUT = "";

   void run() throws Exception {
      is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
      pw = new PrintWriter(System.out);
      long s = System.currentTimeMillis();
      solve();
      pw.flush();
      if (!INPUT.isEmpty()) tr(System.currentTimeMillis() - s + "ms");


   }

   public static void main(String[] args) throws Exception {
      new Main().run();
   }

   private byte[] inbuf = new byte[1024];
   public int lenbuf = 0, ptrbuf = 0;

   private int readByte() {
      if (lenbuf == -1) throw new InputMismatchException();
      if (ptrbuf >= lenbuf) {
         ptrbuf = 0;
         try {
            lenbuf = is.read(inbuf);
         } catch (IOException e) {
            throw new InputMismatchException();
         }
         if (lenbuf <= 0) return -1;
      }
      return inbuf[ptrbuf++];
   }

   private boolean isSpaceChar(int c) {
      return !(c >= 33 && c <= 126);
   }

   private int skip() {
      int b;
      while ((b = readByte()) != -1 && isSpaceChar(b)) ;
      return b;
   }

   private double nd() {
      return Double.parseDouble(ns());
   }

   private char nc() {
      return (char) skip();
   }

   private String ns() {
      int b = skip();
      StringBuilder sb = new StringBuilder();
      while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
         sb.appendCodePoint(b);
         b = readByte();
      }
      return sb.toString();
   }

   private char[] ns(int n) {
      char[] buf = new char[n];
      int b = skip(), p = 0;
      while (p < n && !(isSpaceChar(b))) {
         buf[p++] = (char) b;
         b = readByte();
      }
      return n == p ? buf : Arrays.copyOf(buf, p);
   }

   private char[][] nm(int n, int m) {
      char[][] map = new char[n][];
      for (int i = 0; i < n; i++) map[i] = ns(m);
      return map;
   }

   private int[] na(int n) {
      int[] a = new int[n];
      for (int i = 0; i < n; i++) a[i] = ni();
      return a;
   }

   private int ni() {
      int num = 0, b;
      boolean minus = false;
      while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
      if (b == '-') {
         minus = true;
         b = readByte();
      }

      while (true) {
         if (b >= '0' && b <= '9') {
            num = num * 10 + (b - '0');
         } else {
            return minus ? -num : num;
         }
         b = readByte();
      }
   }

   private long nl() {
      long num = 0;
      int b;
      boolean minus = false;
      while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
      if (b == '-') {
         minus = true;
         b = readByte();
      }

      while (true) {
         if (b >= '0' && b <= '9') {
            num = num * 10 + (b - '0');
         } else {
            return minus ? -num : num;
         }
         b = readByte();
      }
   }

   private boolean oj = System.getProperty("ONLINE_JUDGE") != null;

   private void tr(Object... o) {
      if (INPUT.length() > 0) System.out.println(Arrays.deepToString(o));
   }

}