#include <bits/stdc++.h>
#define SZ(c) ((int)(c).size())

using namespace std;

typedef long long LL;
typedef pair<int, int> pii;

const int N = 5e5+10;

int n, a[N];

pii lmx[N << 2], rmx[N << 2];

void init(int i, int l, int r) {
  if (l == r) {
    lmx[i] = pii(a[l], -l);
    rmx[i] = pii(a[l], l);
    return;
  }
  int mid = (l + r) / 2;
  init(i * 2, l, mid);
  init(i * 2 + 1, mid+1, r);
  lmx[i] = max(lmx[i*2], lmx[i*2+1]);
  rmx[i] = max(rmx[i*2], rmx[i*2+1]);
}

void qry(int i, int l, int r, int qa, int qb, pii &qlmx, pii &qrmx) {
  if (qa <= l && r <= qb) {
    qlmx = max(qlmx, lmx[i]);
    qrmx = max(qrmx, rmx[i]);
    return;
  }
  if (qb < l || r < qa) {
    return;
  }
  int mid = (l + r) / 2;
  qry(i * 2, l, mid, qa, qb, qlmx, qrmx);
  qry(i * 2 + 1, mid+1, r, qa, qb, qlmx, qrmx);
}

int cur;
int h[N];

void dfs(int l, int r) {
  if (l > r)
    return;
  pii qlmx{0, 0};
  pii qrmx{0, 0};
  qry(1, 1, n, l, r, qlmx, qrmx);
  if (qlmx.second == -l) {
    h[l] = cur;
    --cur;
    dfs(l + 1, r);
  } else {
    h[qrmx.second] = cur;
    --cur;
    dfs(l, qrmx.second - 1);
    dfs(qrmx.second + 1, r);
  }
}

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a+i);
  }
  init(1, 1, n);
  cur = n;
  dfs(1, n);
  for (int i = 1; i <= n; ++i)
    printf("%d%c", h[i], " \n"[i == n]);
}