#include <fstream>
#include <stack>
#define NMAX 30005
#define ub(x) (x & -x)

using namespace std;

stack < int > st;

int aib[NMAX], clas[NMAX], n, a;

void update(int p)
{
    for (int i = p; i <= n; i += ub(i))
        aib[i]++;
}

int query(int p)
{
    int suma = 0;
    for (int i = p; i >= 1; i -= ub(i))
        suma += aib[i];
    return suma;
}

int bsearch(int p, int u, int key)
{
    int m;
    while (p <= u)
    {
        m = (p + u) / 2;
        if(m - query(m) <= key) p = m + 1;
        else u = m - 1;
    }
    m = (p + u) / 2;
    while (m - query(m) >= key && m) m--;
    return m + 1;
}


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

    ios_base::sync_with_stdio(0);
    fin.tie(NULL);

    fin >> n;

    for (int i = 1; i <= n; ++i)
    {
        fin >> a;
        st.push(a);
    }

    for (int i = n; i >= 1; --i)
    {
        a = st.top();
        st.pop();
        int p = bsearch(a, n, a);
        clas[p] = i;
        update(p);
    }

    for (int i = 1; i <= n; ++i)
        fout << clas[i] << "\n";

    return 0;
}