#include<cstdio>
#include<fstream>
#include<string>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "schi";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 30000 + 5;

int N;
int V[NMAX];
int AI[4 * NMAX];
int sol[NMAX];

void build(int nod, int lo, int hi) {
    if(lo == hi) {
        AI[nod] = 1;
        return;
    }

    int mi = (lo + hi) / 2;

    build(2 * nod, lo, mi);
    build(2 * nod + 1, mi + 1, hi);

    AI[nod] = AI[2 * nod] + AI[2 * nod + 1];
}

void update(int nod, int lo, int hi, int poz) {
    if(lo == hi) {
        AI[nod] = 0;
        return;
    }

    int mi = (lo + hi) / 2;

    if(poz <= mi)
        update(2 * nod, lo, mi, poz);
    else
        update(2 * nod + 1, mi + 1, hi, poz);

    AI[nod] = AI[2 * nod] + AI[2 * nod + 1];
}

int query(int nod, int lo, int hi, int poz) {
    if(lo == hi)
        return lo;

    int mi = (lo + hi) / 2;

    if(poz <= AI[2 * nod])
        return query(2 * nod, lo, mi, poz);
    else
        return query(2 * nod + 1, mi + 1, hi, poz - AI[2 * nod]);
}

int main() {
    int i, x;

#ifndef ONLINE_JUDGE
    ifstream fin(inputFile);
    ofstream fout(outputFile);
#endif

    fin >> N;

    for(i = 1; i <= N; i++)
        fin >> V[i];

    build(1, 1, N);

    for(i = N; i >= 1; i--) {
        x = query(1, 1, N, V[i]);
        update(1, 1, N, x);
        sol[x] = i;
    }

    for(i = 1; i <= N; i++)
        fout << sol[i] << '\n';

    return 0;
}