#include<fstream>
using namespace std;
int n,i,j,poz,p[30001],a[30001],val,rez;
int t[1<<16+1];
void update(int nod, int left, int right)
{
	int mij;
	if(left==right)
		t[nod]=val;
	else
	{
		mij=(left+right)/2;
		if(poz<=mij)
			update(2*nod,left,mij);
		else
			update(2*nod+1,mij+1,right);
		t[nod]=t[2*nod]+t[2*nod+1];
	}
}

void search(int nod, int left, int right)
{
	int mij;
	
	if(left==right)
		{
			rez=left;
			return;
	    }
			mij=(left+right)/2;
			if(val<=t[2*nod])
				search(2*nod,left,mij);
			else
			{
				val=val-t[2*nod];
				search(2*nod+1,mij+1,right);
			}
		
}
		
int main()
{
	ifstream f("schi.in");
	ofstream g("schi.out");
	
	f>>n;
	for(i=1;i<=n;++i)
	{
		poz=i;
		val=1;
		update(1,1,n);
		f>>a[i];
	}
	
	for(i=n;i>=1;i--)
	{
		val=a[i];
		search(1,1,n);
		p[rez]=i;
		val=0;
		poz=rez;
		update(1,1,n);
	}
	
	for(i=1;i<=n;++i)
		g<<p[i]<<"\n";
		
		
	
	return 0;
}