#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int a[N], n, ans[N];
pair<int, int> p[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) {
    scanf("%d", a + i);
  }
  for (int i = 0; i < (n); ++i)
    p[i] = make_pair((n - a[i] - a[(i + 1) % n]), i);
  sort(p, p + n);
  for (int i = 0; i < (n); ++i) ans[p[i].second] = n - i - 1;
  for (int i = 0; i < (n); ++i) printf("%d%c", ans[i], " \n"[i + 1 == n]);
  return 0;
}
