#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 23;
int parseInt() {
  int d;
  scanf("%d", &d);
  ;
  return d;
}
int n;
int a[MAXN], b[MAXN];
vector<pair<int, int> > v;
map<int, int> rang;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    a[i] = parseInt();
    v.push_back(make_pair(a[i], i));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; ++i) {
    rang[v[i].first] = i;
    b[i] = v[i].first;
  }
  int rng;
  for (int i = 0; i < n; ++i) {
    rng = rang[a[i]];
    rng = (rng + 1) % n;
    cout << b[rng] << " ";
  }
  return 0;
}
