#include <fstream>
#include <map>
#include <vector>
#include <algorithm>
#include <climits>
#include <set>
//#define f first
//#define s second
//#define int long long
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
int tree[4*300005], ans[300005];
void init(int node, int st, int dr){
if(st==dr){
tree[node]=1;
return;
}
int mid=(st+dr)/2;
init(2*node, st, mid);
init(2*node+1, mid+1, dr);
tree[node]=tree[node*2]+tree[node*2+1];
}
void putfrunz(int node, int st, int dr, int val, int poz){
if(st==dr){
tree[node]=0;
ans[st]=poz;
return;
}
if(val>tree[2*node]){
val-=tree[2*node];
int mid=(st+dr)/2;
putfrunz(2*node+1, mid+1, dr, val, poz);
}
else {
int mid=(st+dr)/2;
putfrunz(2*node, st, mid, val, poz);
}
tree[node]=tree[2*node]+tree[2*node+1];
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<int> v(n+1);
for(int i=n; i>=1; i--){
cin>>v[i];
}
init(1, 1, n);
for(int i=1; i<=n; i++){
putfrunz(1, 1, n, v[i], n-i+1);
}
for(int i=1; i<=n; i++){
cout<<ans[i]<<"\n";
}
}