#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N];
int main() {
  int n, m, i, j, k, x, y, z;
  long long s1 = 0, s2 = 0;
  scanf("%d", &n);
  for (i = 1; i <= 2 * n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 2 * n + 1);
  for (i = 1; i <= n; i++) s1 += a[i];
  for (i = n + 1; i <= 2 * n; i++) s2 += a[i];
  if (s1 == s2) {
    printf("-1\n");
    return 0;
  }
  for (i = 1; i <= 2 * n; i++) printf("%d ", a[i]);
}
