#include <stdio.h>

#define NMAX 400100

int n,m;
int arbore[NMAX],solutie[NMAX],a[NMAX];
int v,p,maxim,f,s;

int max(int a,int b)
{
if (a>b) return a;
   else  return b;
}

void interogare(int nod,int st,int dr)
{
int mij;
if (st==dr)
arbore[nod]=1;
else
{
mij=(st+dr)/2;
interogare(2*nod,st,mij);
interogare(2*nod+1,mij+1,dr);
arbore[nod]=arbore[2*nod]+arbore[2*nod+1];
}
}


void actualizare(int nod,int st,int dr)
{
int mij;
if (st==dr)
{
arbore[nod]=0;
solutie[st]=v;
}
else
{
mij=(st+dr)/2;
if (p<=arbore[2*nod]) actualizare(2*nod,st,mij);
else
{
p-=arbore[2*nod];
actualizare(2*nod+1,mij+1,dr);
}
arbore[nod]=arbore[2*nod]+arbore[2*nod+1];
}
}


int main()
{
int i,b,x;
freopen("schi.in","rt",stdin);
freopen("schi.out","wt",stdout);
scanf("%d",&n);
    for (i=1;i<=n;++i)
	scanf("%d",&a[i]);
	interogare(1,1,n);
    for (i=n;i>=1;--i)
      {
	  v=i;
	  p=a[i];
	  actualizare(1,1,n);
	  }
for (i=1;i<=n;i++)
printf("%d\n",solutie[i]);
return 0;
}