#include <bits/stdc++.h>
#define Mod 666013
using namespace std;

ifstream fin("schi.in");
ofstream fout("schi.out");

int n;
int a[30005], aib[30005], sol[30005];

void Update(int p, int val)
{
    while (p <= n)
    {
        aib[p] += val;
        p += (p & (-p));
    }
}
int Query(int p)
{
    int sum = 0;
    while (p >= 1)
    {
        sum += aib[p];
        p -= (p & (-p));
    }
    return sum;
}

int CautBin(int val)
{
    int st, dr, mij, P;
    st = 1; dr = n; P = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (Query(mij) >= val)
        {
            P = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    Update(P, -1);
    return P;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
        Update(i, 1);
    }
    for (int i = n; i >= 1; i--)
        sol[CautBin(a[i])] = i;
    for (int i = 1; i <= n; i++)
        fout << sol[i] << "\n";
    return 0;
}