#include <iostream>
#include <fstream>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
int ans[30005],v[30005],n,p,arb[120005];

void build(int nod,int lt,int rt,int pos)
{
    if(lt==rt)
    {
        arb[nod]=1;
        return;
    }
    int md=(lt+rt)/2;
    if(pos<=md) build(nod*2,lt,md,pos);
    else build(nod*2+1,md+1,rt,pos);

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

void query(int nod,int lt,int rt,int val)
{
    if(lt==rt)
    {
        arb[nod]=0;
        p=lt;
        return;
    }
    int md=(lt+rt)/2;
    if(val<=arb[nod*2]) query(nod*2,lt,md,val);
    else query(nod*2+1,md+1,rt,val-arb[nod*2]);

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

int main()
{
    f>>n;
    for(int i=1;i<=n;++i)
    {
        f>>v[i];
        build(1,1,n,i);
    }
    for(int i=n;i>=1;--i)
    {
        query(1,1,n,v[i]);
        ans[p]=i;
    }
    for(int i=1;i<=n;++i)
    {
        g<<ans[i]<<'\n';
    }
    return 0;
}