#include <fstream>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
const int N = 3e4 + 5;
int aint[4 * N], ans[N];
int n;
void build(int node, int st, int dr){
if(st == dr){
aint[node] = 1;
return ;
}
int mid = (st + dr) / 2;
build(2 * node, st, mid);
build(2 * node + 1, mid + 1, dr);
aint[node] = aint[2 * node] + aint[2 * node + 1];
}
void update(int node, int st, int dr, int val, int loc){
if(st == dr)
{
aint[node] = 0;
ans[st] = loc;
return ;
}
if(val > aint[2 * node]){
val -= aint[2 * node];
int mid = (st + dr) / 2;
update(2 * node + 1, mid + 1, dr, val, loc);
}
else {
int mid = (st + dr) / 2;
update(2 * node, st, mid, val, loc);
}
aint[node] = aint[2 * node] + aint[2 * node + 1];
}
int main()
{
fin >> n;
build(1, 1, n);
int v[n + 1];
for(int i = 1; i <= n; i ++)
{
fin >> v[i];
}
for(int i = n; i >= 1; i --)
{
update(1, 1, n, v[i], i);
}
for(int i = 1; i <= n; i ++)
{
fout << ans[i] << '\n';
}
return 0;
}