#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const long long mod = 1e9 + 7;
const int maxn = 100010;
typedef struct Node {
  int val;
  int id;
  bool operator<(const struct Node &e) const { return val < e.val; }
} node;
node a[maxn];
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].val);
    a[i].id = i;
  }
  sort(a + 1, a + 1 + n);
  int t = a[1].val;
  for (int i = 1; i < n; i++) {
    a[i].val = a[i + 1].val;
  }
  a[n].val = t;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[j].id == i) {
        cout << a[j].val << " ";
      }
    }
  }
  cout << endl;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  int mark_EOF;
  if (scanf("%d", &mark_EOF) == EOF) return 0;
  return 0;
}
