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.
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int inf = 0x3f3f3f3f;
const long long inf_ll = 0x3f3f3f3f3f3f3f3fLL;
const int maxn = 1005 << 1;
int n;
int a[maxn];
int b[maxn];
void output() {
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  for (int i = 0; i < n; i++) {
    cout << b[i] << " ";
  }
  cout << endl;
}
int main() {
  cin >> n;
  int tota = 0, totb = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    tota += a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    totb += b[i];
  }
  if (tota != totb) {
    output();
    return 0;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[i] != b[j]) {
        swap(a[i], b[j]);
        output();
        return 0;
      }
    }
  }
  cout << -1 << endl;
  return 0;
}
