#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  vector<long long> arr, arr2;
  long long input;
  long long temp;
  int i, j, k;
  long long base;
  long long sum1 = 0, sum2 = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lld", &input);
    arr.push_back(input);
    sum1 += arr[i];
  }
  sort(arr.begin(), arr.end());
  for (i = 0; i < n; i++) {
    scanf("%lld", &input);
    arr2.push_back(input);
    sum2 += arr2[i];
  }
  if (sum1 != sum2) {
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  sort(arr2.begin(), arr2.end());
  j = 0;
  if (arr[0] != arr2[0]) {
    temp = arr[0];
    arr[0] = arr2[0];
    arr2[0] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  base = arr[0];
  for (i = 1; i < n; i++) {
    if (arr[i] != base) {
      break;
    }
  }
  if (i != n) {
    temp = arr[i];
    arr[i] = arr2[0];
    arr2[0] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  base = arr2[0];
  for (i = 1; i < n; i++) {
    if (arr2[i] != base) {
      break;
    }
  }
  if (i != n) {
    temp = arr[0];
    arr[0] = arr2[i];
    arr2[i] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  printf("-1\n");
  return 0;
}

### Prompt

Please create a solution in cpp to the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  vector<long long> arr, arr2;
  long long input;
  long long temp;
  int i, j, k;
  long long base;
  long long sum1 = 0, sum2 = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lld", &input);
    arr.push_back(input);
    sum1 += arr[i];
  }
  sort(arr.begin(), arr.end());
  for (i = 0; i < n; i++) {
    scanf("%lld", &input);
    arr2.push_back(input);
    sum2 += arr2[i];
  }
  if (sum1 != sum2) {
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  sort(arr2.begin(), arr2.end());
  j = 0;
  if (arr[0] != arr2[0]) {
    temp = arr[0];
    arr[0] = arr2[0];
    arr2[0] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  base = arr[0];
  for (i = 1; i < n; i++) {
    if (arr[i] != base) {
      break;
    }
  }
  if (i != n) {
    temp = arr[i];
    arr[i] = arr2[0];
    arr2[0] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  base = arr2[0];
  for (i = 1; i < n; i++) {
    if (arr2[i] != base) {
      break;
    }
  }
  if (i != n) {
    temp = arr[0];
    arr[0] = arr2[i];
    arr2[i] = temp;
    for (i = 0; i < n; i++) {
      printf("%lld ", arr[i]);
    }
    for (i = 0; i < n; i++) {
      printf("%lld ", arr2[i]);
    }
    return 0;
  }
  printf("-1\n");
  return 0;
}

```