#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
void solve(int test_case) {
  int n;
  cin >> n;
  vector<int> v(n + n);
  for (int i = 0; i < n + n; i++) cin >> v[i];
  sort((v).begin(), (v).end());
  long long s1 = 0;
  long long s2 = 0;
  for (int i = 0; i < n; i++) {
    s1 += v[i];
    s2 += v[i + n];
  }
  if (s1 == s2)
    cout << -1;
  else {
    for (auto &val : v) cout << val << " ";
  }
  cout << "\n";
  ;
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}
