#include <bits/stdc++.h>
const int N = 1000001;
using namespace std;
long long int dp1[1 << 22], dp2[1 << 22];
int setBit[1 << 22];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  int a[n], b[n], c[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
    c[i] = a[i];
  }
  for (int i = 1; i < (1 << n); i++) {
    for (int j = 0; j < n; j++) {
      if (i & (1 << j)) {
        setBit[i] = j;
        break;
      }
    }
  }
  sort(a, a + n);
  dp1[0] = 0;
  for (int i = 1; i < (1 << n); i++) {
    dp1[i] = dp1[i ^ (1 << setBit[i])] + a[setBit[i]];
  }
  for (int t = 0; t < n; t++) {
    int l = a[n - 1];
    for (int i = n - 1; i; i--) {
      a[i] = a[i - 1];
    }
    a[0] = l;
    dp2[0] = 0;
    bool cs = true;
    for (int i = 1; i < (1 << n) - 1; i++) {
      dp2[i] = dp2[i ^ (1 << setBit[i])] + a[setBit[i]];
      if (dp1[i] == dp2[i]) {
        cs = false;
        break;
      }
    }
    if (cs) {
      map<int, int> d;
      sort(c, c + n);
      for (int i = 0; i < n; i++) {
        d[c[i]] = a[i];
      }
      for (int e : b) {
        cout << d[e] << ' ';
      }
      return 0;
    }
  }
  cout << -1;
}
