#include <fstream>

using namespace std;

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

const int NMax = 30000;

int AIB[NMax + 5], Sol[NMax + 5], V[NMax + 5], N;

void Update(int p)
{
    for(int i = p; i <= N; i += i & (-i))
        AIB[i]++;
}

int Sum(int p)
{
    int Sol = 0;

    for(int i = p; i > 0; i -= i & (-i))
        Sol += AIB[i];

    return Sol;
}

int Find(int k)
{
    int st = 1, dr = N, m, val, Ans;

    while(st <= dr)
    {
        m = (st + dr) >> 1;
        val = m - Sum(m);

        if(val == k)
            Ans = m;

        (val < k) ? (st = m + 1) : (dr = m - 1);
    }
    return Ans;
}

int main()
{
    fin >> N;

    for(int i = 1; i <= N; i++)
        fin >> V[i];

    for(int i = N, p; i > 0; i--)
    {
        p = Find(V[i]);
        Sol[p] = i;
        Update(p);
    }

    for(int i = 1; i <= N; i++)
        fout << Sol[i] << '\n';

    fin.close();
    fout.close();

    return 0;
}