#include <iostream>
#include <fstream>

#define nMax 30002

using namespace std;

ifstream fin("schi.in");
ofstream fout("schi.out");

int aib[nMax], n, v[nMax], clasament[nMax];

void update(int p, int x){
    while (p <= n){
        aib[p] += x;
        p += (p & (-p));
    }
}

int query(int p){
    int suma = 0;
    while (p > 0){
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}

int cautBin(int val){
    int x, st, dr, mij, p;
    st = 1; dr = p = n;
    while (st <= dr){
        mij = (st + dr) / 2;
        x = query(mij);
        if (x == val)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (x > val) dr = mij - 1;
        else st = mij + 1;
    }
    return p;
}

int main()
{
    int i, p;
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> v[i];

    for (i = 1; i <= n; i++)
        update(i, 1);

    for (i = n; i >= 1; i--){
        p = cautBin(v[i]);
        clasament[p] = i;
        update(p, -1);
    }
    for (i = 1; i <= n; i++)
        fout << clasament[i] << "\n";
    return 0;
}