#include <fstream>

using namespace std;

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

int n, stanga, dreapta, sum, Data[30010], Sol[30010], ARBI[100010];

void Update(int nod, int left, int right, int poz, int value)
{
    if (left == right)
    {
        ARBI[nod] += value;
    }
    else
    {
        int mid = (left + right) >> 1;
        if (poz <= mid)
        {
            Update((nod << 1), left, mid, poz, value);
        }
        else
        {
            Update((nod << 1) + 1, mid + 1, right, poz, value);
        }

        ARBI[nod] = ARBI[(nod << 1)] + ARBI[(nod << 1) + 1];
    }
}

void Query(int nod, int left, int right)
{
    if (stanga <= left && right <= dreapta)
    {
        sum += ARBI[nod];
        return;
    }

    int mid = (left + right) >> 1;
    if (stanga <= mid)
    {
        Query((nod << 1), left, mid);
    }
    if (dreapta > mid)
    {
        Query((nod << 1) + 1, mid + 1, right);
    }
}

int Binary_Search(int value)
{
    int i = n, step = 1;
    while (step <= n) step <<= 1;
    step >>= 1;

    while (step)
    {
        if (i - step > 0)
        {
            sum = 0;
            stanga = 1;
            dreapta = i - step;
            Query(1, 1, n);
            if (sum >= value)
            {
                i -= step;
            }
        }
        step >>= 1;
    }

    return i;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> Data[i];
        Update(1, 1, n, i, 1);
    }

    for (int i = n ; i >= 1; i--)
    {
        int poz = Binary_Search(Data[i]);
        Sol[poz] = i;
        Update(1, 1, n, poz, -1);
    }

    for (int i = 1; i <= n; i++) fout << Sol[i] << '\n';
    fout.close();
    return 0;
}