#include <iostream>
#include<cstdio>
using namespace std;
int n, poz[30001], aib[30001], v[30001];
void update(int poz,int val)
{
    int a;
    while(poz<=n)
    {
        aib[poz]+=val;
        a=(poz^(poz&(poz-1)));
        poz+=a;
    }
}
int query(int x)
{
    int sum=0;
    while(x)
    {
        sum+=aib[x];
        x-=(x^(x&(x-1)));
    }
    return sum;
}
int main()
{
    freopen("schi.in","r",stdin);
    freopen("schi.out","w",stdout);
    int i,l1,l2,mij;
    scanf("%d", &n);
    for(i=1;i<=n;i++)
    {
        scanf("%d", &v[i]);
        update(i,1);
    }
    for(i=n;i>=1;i--)
    {
        l1=1;
        l2=n;
        while(l1<=l2)
        {
            mij=(l1+l2)/2;
            if(query(mij)>=v[i])
                l2=mij-1;
            else l1=mij+1;
        }
        update(l1,-1);
        poz[l1]=i;
    }
    for(i=1;i<=n;i++)
        printf("%d\n", poz[i]);
    return 0;
}