#include <bits/stdc++.h>
#define inf 2000000000
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int i,j,n,m;
vector <int> v;
int o[30005];
struct nod{
    int info;
    int pri,nr;
    nod *st, *dr;
    nod(int info, int pri, nod *st, nod *dr)
    {
        this->dr = dr;
        this->st = st;
        this->info = info;
        this->pri = pri;
        nr = 0;
    }
};
nod *T,*Ts,*Td,*nil;

void upd(nod *&n)
{
    n->nr = n->st->nr + n->dr->nr + 1;
}
void rotateleft(nod *&n)
{
    nod *x = n->st;
    n->st = x->dr;
    x->dr = n;
    n = x;
}

void rotateright(nod *&n)
{
    nod *x = n->dr;
    n->dr = x->st;
    x->st = n;
    n = x;
}

void balance(nod *&n)
{
    if(n->pri < n->st->pri)
        rotateleft(n);
    else
        if(n->pri < n->dr->pri)
            rotateright(n);
    upd(n);
}

void insert(nod *&n, int info, int prioritate)
{
    if(n == nil)
    {
        n = new nod(info,prioritate,nil,nil);
        n->nr= 1;
        return;
    }

    if(info < n->info)
        insert(n->st,info,prioritate);
    else
        insert(n->dr,info,prioritate);

    balance(n);
}

void del(nod *&n,int info)
{
    if(n == nil)
        return;
    if(info > n->info)
        del(n->dr, info);
    else
    if(info < n->info)
        del(n->st, info);
    else
    if(n->st == nil && n->dr == nil){
        delete n, n = nil;return;}
    else
    {
        if(n->st->pri > n->dr->pri){
            rotateleft(n);
            del(n->dr,info);}
        else
            rotateright(n),del(n->st,info);

    }
    upd(n);
}

void afiseaza(nod *n)
{
    if(n == nil)
        return;
    afiseaza(n->st);
    fout<<n->info<<'\n';
    afiseaza(n->dr);
}

void split(nod *&T, nod *&Ts, nod *&Td, int info)
{
    insert(T,info,inf+100);
    Ts = T->st;
    Td = T->dr;
    delete T, T=nil;
}

void join(nod *&T, nod *&Ts, nod *&Td)
{
    T = new nod(0,0,Ts,Td);
    del(T,T->info);
}
int find(nod *&n,int k)
{
    if(n->st->nr < k)
    {
        k -= n->st->nr;
        if(k == 1)
            return n->info;
        else
            return find(n->dr,k-1);
    }
    else
        return find(n->st,k);

}
void afisare(nod *&n)
{
    if(n == nil)
        return;
    afisare(n->st);
    fout<<n->info<<'\n';
    afisare(n->dr);
}
int main()
{
    srand(time(0));
    T = nil = new nod(0,0,NULL,NULL);
    fin >> n;
    int a;
    for(i = 1 ; i <= n; i++)
    {
        fin >> a;
        v.push_back(a);
        insert(T,i,rand()%inf+1);
    }
    for(i = n-1; i >=0; i--)
    {
        a = find(T,v[i]);
        o[a] = i+1;
        del(T,a);
    }
    for(i = 1; i <= n; i++)
        fout<<o[i]<<'\n';
    return 0;
}