#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e4 + 10;
int n, ans[MAXN], p[MAXN], id[MAXN];
int cmp(int a, int b) {
  return ((n - p[a]) - p[(a + 1) % n]) > ((n - p[b]) - p[(b + 1) % n]);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &p[i]);
    id[i] = i;
  }
  sort(id + 0, id + n, cmp);
  for (int i = 0; i < n; ++i) ans[id[i]] = i;
  for (int i = 0; i < n; ++i) printf("%d ", ans[i]);
  return 0;
}
