#include <iostream>
#include <fstream>
#define NMAX 30000

using namespace std;

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

int n, arb[4*NMAX+1000], cls[NMAX], sol[NMAX];

void update (int nod_crt, int left, int right, int pos, int val)
{
    if(left==right)
    {
        arb[nod_crt]=val;
        return;
    }
    int middle=(left+right)/2;
    if(pos<=middle)
        update(2*nod_crt, left, middle, pos, val);
    else
        update(2*nod_crt+1, middle+1, right, pos, val);
    arb[nod_crt]=arb[2*nod_crt]+arb[2*nod_crt+1];
}

int find_poz_nestearsa(int nod_crt, int left, int right, int k)
{
    if(left==right)
        return left;
    int middle=(left+right)/2;
    if(arb[2*nod_crt]<k)
        return find_poz_nestearsa(2*nod_crt+1, middle+1, right, k-arb[2*nod_crt]);
    else
        return find_poz_nestearsa(2*nod_crt, left, middle, k);
}

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++){
        fin>>cls[i];
        update(1, 1, n, i, 1);
    }
    for(int i=n; i>=1; i--)
    {
        int poz=find_poz_nestearsa(1, 1, n, cls[i]);
        //cout<<poz<<" ";
        sol[poz]=i;
        update(1, 1, n, poz, 0);
    }
    for(int i=1; i<=n; i++)
        fout<<sol[i]<<"\n";
    return 0;
}