#include <bits/stdc++.h>
#define DIM 30010
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int n,i,v[DIM],A[4*DIM],sol[DIM];
void build(int nod,int st,int dr) {
    if (st==dr)
        A[nod]=1;
    else {
        int mid=(st+dr)/2;
        build(2*nod,st,mid);
        build(2*nod+1,mid+1,dr);
        A[nod]=A[2*nod]+A[2*nod+1];
    }
}
void update(int nod,int st,int dr,int poz,int val) {
    if (st==dr) {
        A[nod]=0;
        sol[st]=val;
    }
    else {
        int mid=(st+dr)/2;
        if (poz<=A[2*nod])
            update(2*nod,st,mid, poz,val);
        else
            update(2*nod+1,mid+1,dr,poz-A[2*nod],val);
        A[nod]=A[2*nod]+A[2*nod+1];
    }
}
int main() {
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    build(1,1,n);
    for (i=n;i>=1;i--) //in loc sa adaugam pozitiile, le stergem de la sfarsit la inceput
        update(1,1,n,v[i],i); //gasim pozitia v[i] si aflam locul in care se afla pe clasamentul final
    for (i=1;i<=n;i++)
        fout<<sol[i]<<"\n";
    return 0;
}