#include <bits/stdc++.h>

using namespace std;

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

int aib[100003], n, k;

int a[100003], sol[100003];

void Update(int p, int x)
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int suma = 0;
    while (p > 0)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}

int Cauta(int k)
{
    int st, dr, mij, p, suma;
    st = 1; dr = n; p = n+1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        suma = Query(mij);
        if (suma == k)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (suma < k) st = mij + 1;
        else dr = mij - 1;
    }
    return p;
}


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