#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int MAGIC = 200;
int n;
int a[N];
int ans[N];
pair<int, int> b[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n; i++) {
    b[i] = make_pair(a[i] + a[(i + 1) % n], i);
  }
  sort(b, b + n);
  for (int i = 0; i < n; i++) ans[b[i].second] = i;
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  return 0;
}
