#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
const int Nmax = 30001;
int n, v[Nmax], tree[4 * Nmax], ans, pos, val, res[Nmax];
void update(int node, int left, int right)
{
    if(left == right)
    {
        tree[node] = val;
        return;
    }
    int mij = (left + right) / 2;
    if(pos <= mij)
        update(2 * node, left, mij);
    else
        update(2 * node + 1, mij + 1, right);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
void query(int node, int left, int right, int k)
{
    if(left == right)
    {
        ans =left;
        return;
    }
    int mij = (left + right) / 2;
    if(tree[2 * node] >= k)
        query(2 * node, left, mij, k);
    else
        query(2 * node + 1, mij + 1, right, k - tree[2 * node]);
}
int main()
{
    cin >> n;
    for(int i=1; i<=n; i++)
    {
        pos = i, val = 1;
        update(1, 1, n);
        cin >> v[i];
    }
    for(int i=n; i>=1; i--)
    {
        ans = 0;
        query(1, 1, n, v[i]);
        res[ans] = i;
        pos = ans, val = 0;
        update(1, 1, n);
    }
    for(int i=1; i<=n; i++)
        cout << res[i] << '\n';
    return 0;
}