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>
using namespace std;
long long int minimumSwaps(long long int a[], long long int n) {
  pair<long long int, long long int> arr[n];
  for (long long int i = 0; i < n; i++) {
    arr[i].first = a[i];
    arr[i].second = i;
  }
  sort(arr, arr + n);
  long long int vis[n];
  for (long long int i = 0; i < n; i++) {
    vis[i] = 0;
  }
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    if (vis[i] || arr[i].second == i)
      continue;
    else {
      long long int j = i, nodes = 0;
      while (!vis[j]) {
        vis[j] = 1;
        j = arr[j].second;
        nodes++;
      }
      ans += nodes - 1;
    }
  }
  return ans;
}
int main() {
  ifstream myFile("task.in");
  if (!myFile.fail()) {
    assert(freopen("task.in", "r", stdin));
  }
  long long int n;
  cin >> n;
  int n1 = n * 2;
  long long int arr[n1 + 10];
  for (long long int i = 0; i < n1; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n1);
  int sum[n1 + 10];
  sum[0] = arr[0];
  for (int i = 1; i < n1; i++) {
    sum[i] = arr[i] + sum[i - 1];
  }
  if (sum[n - 1] != sum[n1 - 1] - sum[n - 1]) {
    for (int i = 0; i < n1; i++) {
      cout << arr[i] << " ";
    }
    cout << endl;
  } else {
    cout << "-1" << endl;
  }
  return 0;
}
