#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> B;
vector<pair<int, int> > C;
vector<int> A;
int main() {
  scanf("%d", &N);
  B.resize(N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &B[i]);
  }
  for (int i = 0; i < N; i++) {
    int l = N - B[i];
    int r = B[(i + 1) % N];
    C.push_back(pair<int, int>(l - r, i));
  }
  sort(C.begin(), C.end());
  A.resize(N);
  for (int i = 0; i < N; i++) {
    A[C[i].second] = N - 1 - i;
  }
  for (int i = 0; i < N; i++) {
    printf("%d ", A[i]);
  }
}
