#include<cstdio>
#include<fstream>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ll long long

const int maxn = 65000;
int i , n;
ifstream fin("schi.in");
ofstream fout("schi.out");
short int v[maxn] , result[maxn] , SegTree[maxn];

short build ( short node , short lf , short rt ) {
	if ( lf == rt ) SegTree[node] = 1;
	else { 
		short mid = ( lf + rt ) >> 1;
		SegTree[node] = build ( 2 * node , lf , mid ) + build ( 2 * node + 1 , mid + 1 , rt ) ;
	}
	return SegTree[node];
}
	
int query( int node , int lf , int rt , int k ) {
	SegTree[node] --;
	if ( lf == rt ) return lf;
	int mid = ( lf + rt ) >> 1;
	if ( k <= SegTree[2 * node] ) 
		return query( 2 * node , lf , mid , k);
	else
		return query( 2 * node + 1 , mid + 1 , rt , k - SegTree[2 * node]);
}


int main()
{
	fin >> n;
	for( i = 1 ; i <= n ; ++i ) fin >> v[i];
		build(1 , 1 , n);
	
	for( i = n ; i >= 1 ; --i ) {
		int poz = query( 1 , 1 , n , v[i] );
		result[poz] = i;
	}
	for( i = 1 ; i <= n ; ++i )
		fout << v[i] << "\n";
return 0;
}