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.*;
import java.util.stream.Collectors;

public class Task1 {

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(reader.readLine());
        List<Integer> list = Arrays.stream(reader.readLine().split(" ")).map(Integer::parseInt).collect(Collectors.toList());

        int sum1 = 0;
        int sum2 = 0;
        for (int i = 0; i < list.size() / 2; i++) {
            sum1 += list.get(i);
            sum2 += list.get(list.size() - 1 - i);
        }

        if (sum1 != sum2){
            for (Integer integer : list) {
                System.out.print(integer + " ");
            }
            return;
        }


        for (int i = 0; i < list.size() / 2; i++) {

            for (int j = 0; j < list.size() / 2; j++) {
                if (list.get(i) != list.get(list.size() - 1 - j)){

                    int s1 = sum1 - list.get(i) + list.get(list.size() - 1 - j);
                    int s2 = sum2 + list.get(i) - list.get(list.size() - 1 - j);

                    if (s1 != s2){

                        //swap
                        int temp = list.get(i);
                        list.set(i, list.get(list.size() - 1 - j));
                        list.set(list.size() - 1 - j, temp);

                        for (Integer integer : list) {
                            System.out.print(integer + " ");
                        }
                        return;
                    }
                }
            }
        }
        System.out.println(-1);
    }
}
