#include <bits/stdc++.h>
#define nMax 30005

using namespace std;

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

int n;
int a[nMax], aint[nMax * 4], sol[nMax];

inline void Read()
{
    int i;
    fin >> n;
    for(i = 1; i <= n; i++)
        fin >> a[i];
}

inline void Build(int nod, int st, int dr)
{
    if(st == dr)
    {
        aint[nod] = 1;
        return;
    }
    int m = (st + dr) / 2;
    Build(nod * 2, st, m);
    Build(nod * 2 + 1, m + 1, dr);
    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}

inline void Update(int nod, int st, int dr, int p)
{
    if(st == dr)
    {
        aint[nod] = 0;
        return;
    }
    int m = (st + dr) / 2;
    if(p <= m)
        Update(2 * nod, st, m, p);
    else
        Update(2 * nod + 1, m + 1, dr, p);
    aint[nod] = aint[2 * nod] + aint[2 * nod + 1];
}

inline int Querry(int nod, int st, int dr, int k)
{
    if(st == dr)
        return st;
    int m = (st + dr) / 2;
    if(k <= aint[nod * 2])
        return Querry(nod * 2, st, m, k);
    return Querry(nod * 2 + 1, m + 1, dr, k - aint[nod * 2]);
}

inline void Solve()
{
    int i, p;
    for(i = n; i > 0; i--)
    {
        p = Querry(1, 1, n, a[i]);
        sol[p] = i;
        Update(1, 1, n, p);
    }
    for(i = 1; i <= n; i++)
        fout << sol[i] << "\n";
}

int main()
{
    Read();
    Build(1, 1, n);
    Solve();
    fin.close();fout.close();
    return 0;
}