#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstring>
#include<queue>
using namespace std;
int n,i,p,u,mij,poz[30009],a[30009],aib[30009],A[30009];
void U(int poz,int val){while(poz<=n)aib[poz]+=val,poz+=poz-(poz&(poz-1));}
int Q(int poz){int s=0;while(poz)s+=aib[poz],poz&=poz-1;return s;}
int main()
{
freopen("schi.in","r",stdin);
freopen("schi.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
for(i=n;i>=1;i--)
{
    p=1;
    u=n;
    while(p<=u)
    {
        mij=(p+u)>>1;
        if(mij-Q(mij)>=a[i])
        {
            poz[i]=mij;
            u=mij-1;
        }
        else p=mij+1;
    }
    U(poz[i],1);
    A[poz[i]]=i;
}
for(i=1;i<=n;i++)
    printf("%d\n",A[i]);
return 0;
}