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.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class ehab {
	public static void main(String[] args) throws Exception {
		FastScanner in = new FastScanner(System.in);
		
		int n = in.nextInt();
		int[] arr = new int[n*2];
		
		for (int i = 0; i < 2 * n; i++)
			arr[i] = in.nextInt();
		
		Arrays.sort(arr);
		
		boolean f = false;
		
		for (int i = 0; i < n; i++)
		{
			int[] temp = Arrays.copyOf(arr, n * 2);
			int tmp = arr[i];
			arr[i] = arr[i + n];
			arr[i + n] = tmp;
			if (sum(temp, 0, n) != sum(temp, n, n * 2))
			{
				for (int t: temp)
					System.out.print(t + " ");
				System.out.println();
				f = true;
				break;
			}
		}
		
		if (!f)
			System.out.println(-1);
		
	}
	
	static long sum(int[] arr, int s, int e)
	{
		long sum = 0;
		for (int i = s; i < e; i++)
			sum += arr[i];
		return sum;
	}
	
	static class FastScanner {
	    BufferedReader br;
	    StringTokenizer st;
		
	    public FastScanner(InputStream i) {
	        br = new BufferedReader(new InputStreamReader(i));
	        st = new StringTokenizer("");
	    }
				
	    public String next() throws IOException {
	        if(st.hasMoreTokens())
	            return st.nextToken();
	        else
	            st = new StringTokenizer(br.readLine());
	        return next();
	    }

	    public int nextInt() throws IOException {
	        return Integer.parseInt(next());
	    }
	    //#
	    public long nextLong() throws IOException {
	        return Long.parseLong(next());
	    }
	    public double nextDouble() throws IOException {
	        return Double.parseDouble(next());
	    }
	    //$
	}
}
