#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
inline void chkmax(T& x, U y) {
  if (x < y) x = y;
}
template <class T, class U>
inline void chkmin(T& x, U y) {
  if (y < x) x = y;
}
const int N = 1e5 + 5;
int st[N], en[N], id[N], n, tp[N];
bool cmp(const int i, const int j) {
  return (n - st[i] - en[i]) > (n - st[j] - en[j]);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", st + i);
    if (i) en[i - 1] = st[i];
    id[i] = i;
  }
  en[n - 1] = st[0];
  sort(id, id + n, cmp);
  for (int i = 0; i < n; i++) tp[id[i]] = i;
  for (int i = 0; i < n; i++) printf("%d%c", tp[i], " \n"[i == n - 1]);
  return 0;
}
