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.
(function () {
    var read = {
        number: function () {
            return +readline();
        },
        arr: function (divider) {
            return readline().split(divider ? divider : '');
        },
        arrNumber: function (divider) {
            return readline()
                .split(divider ? divider : '')
                .map(item => +item);
        }
    };

    var n = read.number();
    var a = read.arrNumber(' ');

    var sum1 = 0;
    var sum2 = 0;
    for(var i = 0; i < n; i++) {
        sum1 += a[i];
        sum2 += a[i + n];
    }

    if(sum1 !== sum2) {
        print(a.join(' '));
        return;
    }

    var eq = true;
    for(var i = 1; i < 2 * n; i++) {
        if(a[i] !== a[i - 1]) {
            eq = false;
            break;
        }
    }

    if(eq) {
        print(-1);
        return;
    }


    for(var i = 0; i < n; i++) {
        for(var j = 0; j < n; j++) {
            if(a[i] != a[n + j]) {
                var tmp = a[i];
                a[i] = a[n + j];
                a[n + j] = tmp;
                print(a.join(' '));
                return;
            }
        }
    }

}());