#include <fstream>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
const int MAXN=30001;
int v[MAXN],ans[MAXN],tree[4*MAXN];
void build(int vertex,int tl,int tr) {
if (tl==tr) tree[vertex]=1;
else {
int tm=(tl+tr)/2;
build(vertex*2,tl,tm);
build(vertex*2+1,tm+1,tr);
tree[vertex]=tree[vertex*2]+tree[vertex*2+1];
}
}
void query(int vertex,int tl,int tr,int pos,int val) {
if (tl==tr) {
ans[tl]=val;
tree[vertex]--;
}
else {
int tm=(tl+tr)/2;
if (pos<=tree[vertex*2]) query(vertex*2,tl,tm,pos,val);
else query(vertex*2+1,tm+1,tr,pos-tree[vertex*2],val);
tree[vertex]=tree[vertex*2]+tree[vertex*2+1];
}
}
int main() {
int n;
cin>>n;
build(1,1,n);
for (int i=1; i<=n; ++i) cin>>v[i];
for (int i=n; i>=1; --i) query(1,1,n,v[i],i);
for (int i=1; i<=n; ++i) cout<<ans[i]<<'\n';
}