#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
long long read() {
  long long s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * f;
}
inline void print(long long *f, long long len) {
  for (long long i = 0; i < len; i++) printf("%lld ", f[i]);
  puts("");
}
long long a[101010], pos[101010], ans[101010];
long long cmp(long long x, long long y) {
  return ((n - a[x]) - a[(x + 1) % n]) > ((n - a[y]) - a[(y + 1) % n]);
}
signed main() {
  n = read();
  for (long long i = 0, iend = n - 1; i <= iend; ++i) a[i] = read(), pos[i] = i;
  sort(pos, pos + n, cmp);
  for (long long i = 0, iend = n - 1; i <= iend; ++i) ans[pos[i]] = i;
  for (long long i = 0, iend = n - 1; i <= iend; ++i) printf("%d ", ans[i]);
}
