#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n], b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  for (int i = 0; i < n; i++) {
    int p = lower_bound(b, b + n, a[i]) - b;
    p = (p + 1) % n;
    cout << b[p] << ' ';
  }
  cout << endl;
  return 0;
}
