#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstring>
#include<queue>
using namespace std;
int Aa,n,i,p,u,mij,poz,a[30009],aib[30009],A[30009];
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);
srand(time(0));
scanf("%d",&n);
for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
for(i=n;i>=1;i--)
{
    poz=a[i];
    while(1)
    {
        Aa=Q(poz);
        if(poz-Aa<a[i])
            poz=a[i]+Aa;
        else break;
    }
    A[poz]=i;
    while(poz<=n)aib[poz]++,poz+=poz&(-poz);
}
for(i=1;i<=n;i++)
    printf("%d\n",A[i]);
return 0;
}