#include <bits/stdc++.h>
using namespace std;
const int maxi = 1e6 + 2;
pair<int, int> b[maxi];
int n;
int a[maxi], res[maxi];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) b[i] = {a[i] + a[(i + 1) % n], i};
  sort(b, b + n);
  for (int i = 0; i < n; i++) res[b[i].second] = i;
  for (int i = 0; i < n; i++) printf("%d ", res[i]);
  printf("\n");
  return 0;
}
