#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, tree[4 * Nmax];
vector<int> v;
void update(int node, int left, int right, int pos, int val)
{
    if(left == right)
    {
        tree[node] = val;
        return;
    }
    int mij = (left + right) / 2;
    if(pos <= mij)
        update(2 * node , left, mij, pos, val);
    else
        update(2 * node + 1, mij + 1, right, pos , val);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int ans = 0;
void query(int node, int left, int right, int k)
{
    if(left == right)
    {
        ans = left;
        return;
    }
    int mij = (left + right) / 2;
    int sumast = tree[2 * node];
    if(sumast >= k)
        query(2 * node, left, mij, k);
    else
        query(2 * node + 1, mij + 1, right, k - sumast);
}
int main()
{
    cin >> n;
    v.resize(n + 1);
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i];
        update(1 , 1, n, v[i], 1);
    }
    for(int i = 1; i <= n; i++)
        update(1 , 1, n, i, 1);
    //reverse(v.begin() + 1, v.end());
    vector<int> res(n + 1, 0);
    for(int i = n; i >= 1; i--)
    {
        query(1, 1, n, v[i]);
        res[ans] = i;

        update(1, 1, n, ans, 0);
    }
    for(int i = 1; i <= n; i++)
        cout << res[i] << '\n';
    return 0;
}