#include <bits/stdc++.h>

using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
const int DIM = 3e4;
int n, v[DIM + 3], rez[DIM + 3], aint[4 * DIM + 3];

inline void build(int nod, int st, int dr) {
    if(st == dr) fin >> v[st], aint[nod] = 1;
    else {
        int mid = (st + dr) / 2;
        build(2 * nod, st, mid);
        build(2 * nod + 1, mid + 1, dr);
        aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
    }
}

inline void update(int nod, int st, int dr, int poz, int val) {
    if(st == dr) aint[nod] = val;
    else {
        int mid = (st + dr) / 2;
        if(poz <= mid) update(2 * nod, st, mid, poz, val);
        else update(2 * nod + 1, mid + 1, dr, poz, val);
        aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
    }
}

inline int query(int nod, int st, int dr, int k) {
    ///gaseste a k-a valoare de 1
    if(st == dr) return st;
    else {
        int mid = (st + dr) / 2;
        if(aint[2 * nod] >= k) return query(2 * nod, st, mid, k); ///caut in stanga
        else return query(2 * nod + 1, mid + 1, dr, k - aint[2 * nod]); ///caut in dreapta
    }
}

int main()
{
    fin >> n;
    build(1, 1, n);
    for(int i=n; i>=1; i--) {
        int poz = query(1, 1, n, v[i]); ///caut a v[i]-a poz libera
        rez[poz] = i;
        update(1, 1, n, poz, 0);
    }
    for(int i=1; i<=n; i++) fout << rez[i] << '\n';

    return 0;
}