#include <fstream>
using namespace std;
ifstream cin ("schi.in");
ofstream cout ("schi.out");
const int NMAX = 30000;
int n;
int v[NMAX + 5];
int sol[NMAX + 5];
int aint[NMAX * 4 + 5];
void build (int nod, int l, int r){
if (l == r){
aint[nod] = 1; return;
}
int mid = (l + r) / 2;
build(nod * 2, l, mid);
build(nod * 2 + 1, mid + 1, r);
aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
void query (int nod, int l, int r, int poz, int val){
if (l == r){
aint[nod] = 0;
sol[l] = poz;
return;
}
int mid = (l + r) / 2;
if (aint[nod * 2] < val){
val -= aint[nod * 2];
query(nod * 2 + 1, mid + 1, r, poz, val);
}
else{
query(nod * 2, l, mid, poz, val);
}
aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
int main()
{
cin >> n;
for (int i = n; i >= 1; --i){
cin >> v[i];
}
build(1, 1, n);
for (int i = 1; i <= n; ++i){
int poz = n - i + 1;
query(1, 1, n, poz, v[i]);
}
for (int i = 1; i <= n; ++i){
cout << sol[i] << '\n';
}
return 0;
}