#include <bits/stdc++.h>
using namespace std;
struct gg {
  int ori;
  int big;
  int diff;
  int id;
} data[50050];
int ans[50050];
bool cop(gg x, gg y) { return x.diff < y.diff; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &data[i].ori);
    data[i].big = n - data[i].ori;
    data[i].id = i;
  }
  for (int i = 1; i < n; i++) {
    data[i].diff = data[i].big - data[i + 1].ori;
  }
  data[n].diff = data[n].big - data[1].ori;
  sort(data + 1, data + 1 + n, cop);
  for (int i = 1; i <= n; i++) {
    ans[data[i].id] = n - i;
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
}
