#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int mod = 1e9 + 7;
const long long longinf = 1000000000000000000;
const double PI = 3.141592653589793;
const int MAXN = 1001000;
int a[MAXN], a1[MAXN], ind[MAXN];
int pos[MAXN];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < n; ++i) {
    a1[i] = a[(i + 1) % n] + a[i];
    ind[i] = i;
  }
  sort(ind, ind + n, [&](int x, int y) { return a1[x] < a1[y]; });
  for (int i = 0; i < n; ++i) {
    pos[ind[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    cout << pos[i] << ' ';
  }
}
int main() {
  cout.precision(20);
  cin.tie(0);
  iostream::sync_with_stdio(false);
  solve();
  return 0;
}
