#include <bits/stdc++.h>

using namespace std;

int n, aib[30005],a[30005],cls[30005];
ifstream fin("schi.in");
ofstream fout("schi.out");

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


///sum a[1..p]
int Suma(int p)
{
    int s = 0;
    while(p > 0)
    {
        s += aib[p];
        p -= (p & (-p));
    }
    return s;
}

///cauta cea mai din stanga pozitie poz cu sum a[1]+..a[poz] = s
int CautBin(int p, int s)
{
    int st, dr, poz, mij;
    int sum;
    st = 1; dr= p; poz = -1;
    while(st <= dr)
    {
        mij = (st + dr)/2;
        sum = Suma(mij);
        if (sum == s)
        {
            poz = mij;
            dr = mij -1;
        }
        else if (sum > s) dr = mij -1;
        else st = mij + 1;
    }
    return poz;
}
int main()
{
    int i, x, poz;
    fin >> n;
    for(i = 1; i <= n; i++)
    {
        fin >> a[i];
        Update(i, 1);
    }
    for(i = n; i >= 1; i--)
    {
        x = a[i];
        ///caut cea mai din st pozitie poz cu suma = x
        poz = CautBin(n , x);
        Update(poz, -1);
        cls[poz] = i;

    }
    for(i = 1; i <= n; i++)
        fout << cls[i] <<"\n";
    fin.close();
    fout.close();
    return 0;
}