#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
int B[100101];
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    scanf("%d", &B[i << 1]);
  }
  long double the = acos(-1) - (n + n - 2) * acos(-1) / (n + n);
  vector<pair<long double, int>> vp;
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    int j = i + i + 1;
    int pre = j - 1, nxt = (j + 1) % (n + n);
    long double tmp = (n - B[pre]) * sin(the) - B[nxt] * sin(the);
    vp.push_back({tmp, i});
  }
  sort(vp.begin(), vp.end());
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    B[vp[i].second] = n - 1 - i;
  }
  for (int(i) = 0; (i) < (int)(n); (i)++) printf("%d ", B[i]);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
