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

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

int aib[100003], n, v[100003], cls[100003];

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

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

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

int main()
{
    int i, x, p;
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> v[i];
    /// construim aib cu 1 peste tot
    for (i = 1; i <= n; i++)
        Update(i, 1);
    /// clasamentul
    for (i = n; i >= 1; i--)
    {
        x = v[i];
        /// cautam cea mai din stanga pozitie p cu suma x
        p = CautBin(x);
        Update(p, -1);
        cls[p] = i;
    }
    for (i = 1; i <= n; i++)
        fout << cls[i] << "\n";
    return 0;
}