#include <fstream>
#include <cmath>

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, T;

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 Ans = 0, p;

    for(int i = T; i > 0; i >>= 1)
    {
        p = Ans + i;

        if(p <= N && p - Sum(p) < k)
            Ans = p;
    }
    return Ans + 1;
}

int main()
{
    fin >> N;
    T = 1 << ((int)log2(N));

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

    for(int i = N, p; i >= 1; 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;
}