#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
int a[MAX], b[MAX];
vector<pair<int, int> > v;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  a[n] = a[0];
  for (int i = 0; i < n; i++) {
    v.push_back({n - a[i] - a[i + 1], i});
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    b[v[i].second] = n - 1 - i;
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", b[i]);
  }
}
