#include <bits/stdc++.h>
using namespace std;
const int maxn = 22;
const int maxm = 1e6;
int a[maxn], b[maxn], c[maxn], t[maxn];
long long int arr[maxm];
int main() {
  srand(time(0));
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> b[i], t[i] = b[i];
  sort(t, t + n);
  for (int i = 0; i < n; i++)
    if (upper_bound(t, t + n, b[i]) - t == n)
      c[i] = t[0];
    else
      c[i] = *upper_bound(t, t + n, b[i]);
  int cnt = 1000;
  while (cnt--) {
    for (int i = 0; i < n; i++) a[i] = b[i] - c[i];
    int sz = 0;
    int ret = 0;
    int k = (n >> 1);
    for (int mask = 0; mask < (1 << k); mask++) {
      long long int sum = 0;
      for (int i = 0; i < k; i++)
        if (mask & (1 << i)) sum = sum + a[i];
      arr[sz++] = sum;
    }
    sort(arr, arr + sz);
    k = n - k;
    int ans = 0;
    for (int mask = 0; mask < (1 << k); mask++) {
      long long int sum = 0;
      for (int i = 0; i < k; i++)
        if (mask & (1 << i)) sum = sum + a[i + (n >> 1)];
      if (lower_bound(arr, arr + sz, -sum) - arr != sz)
        ret +=
            upper_bound(arr, arr + sz, -sum) - lower_bound(arr, arr + sz, -sum);
    }
    if (ret == 2) {
      for (int i = 0; i < n; i++) cout << c[i] << ' ';
      return 0;
    }
    random_shuffle(c, c + n);
  }
  cout << "-1\n";
  return 0;
}
