#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const long long Lbig = 2e18;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c == ' ' || c == '\n') c = _buff.get();
  return c;
}
const double eps = 1e-7;
const double pi = acos(-1);
bool is0(double x) { return x > -eps && x < eps; }
struct point {
  double x, y;
  point(double _x = 0, double _y = 0) {
    x = _x;
    y = _y;
  }
  point operator+(const point &t) const { return point(x + t.x, y + t.y); }
  point operator-(const point &t) const { return point(x - t.x, y - t.y); }
  point operator*(const point &t) const {
    return point(x * t.x - y * t.y, x * t.y + y * t.x);
  }
  point operator*(const double &t) const { return point(x * t, y * t); }
  point operator-() const { return point(-x, -y); }
  double len() const { return sqrt(x * x + y * y); }
  point operator/(const point &t) const {
    return point(x * t.x + y * t.y, -x * t.y + y * t.x) / t.len() / t.len();
  }
  point operator/(const double &t) const { return point(x / t, y / t); }
  double det(const point &t) const { return x * t.y - y * t.x; }
  double dot(const point &t) const { return x * t.x + y * t.y; }
  double sqrl() const { return x * x + y * y; }
  point unit() const { return (*this) / len(); }
  bool operator<(const point &t) const {
    return is0(x - t.x) ? y < t.y : x < t.x;
  }
  bool operator==(const point &t) const { return is0(x - t.x) && is0(y - t.y); }
  void out() { cout << x << "," << y << endl; }
  void in() { cin >> x >> y; }
  double rad() { return atan2(y, x); }
  point conj(const point &p) { return point(p.x, -p.y); }
};
int n, a[50011];
point dir;
double area(point x, point y, point z) { return fabs((y - x).det(z - x)); }
pair<double, int> pp[50011];
void add(int x, int y, int id) {
  point A = point(0, 0);
  point B = point(1, 0);
  point C = A + point(-dir.x, dir.y);
  point D = B + dir;
  point E = C + (A - C) * (1.0 / n) * x;
  point F = B + (D - B) * (1.0 / n) * y;
  pp[id] = make_pair(area(E, F, A) - area(E, F, B), id);
}
int ans[50011];
int main() {
  n = getnum();
  dir = point(cos(pi / n), sin(pi / n));
  for (int i = 1; i <= n; i++) {
    a[i] = getnum();
  }
  a[n + 1] = a[1];
  for (int i = 1; i <= n; i++) {
    add(a[i], a[i + 1], i);
  }
  sort(pp + 1, pp + n + 1);
  for (int i = 1; i <= n; i++) ans[pp[i].second] = n - i + 1;
  for (int i = 1; i <= n; i++) putnum(ans[i] - 1), putchar(' ');
  return 0;
}
