#include <bits/stdc++.h>
using namespace std;
int B[50116], n, id[50116];
double dh[50116], alp;
int ans[50116];
bool cmp(int x, int y) { return dh[x] < dh[y]; }
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) scanf("%d", &B[i]);
  alp = acos(-1.0) / n;
  for (int i = 1; i <= n; ++i)
    dh[i] = (n - B[i]) * sin(alp) - B[(i) % n + 1] * sin(alp), id[i] = i;
  sort(id + 1, id + 1 + n, cmp);
  for (int i = 1; i <= n; ++i) ans[id[i]] = n - i;
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
}
