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

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

int n, m, v[NMAX], ans[NMAX], aint[4*NMAX], res=-1;

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr)
        aint[nod] = val;
    else
    {
        int m = (st+dr)/2;
        if(pos <= m)
            update(2*nod, st, m, pos, val);
        else
            update(2*nod+1, m+1, dr, pos, val);

        aint[nod] = aint[nod*2] + aint[nod*2+1];
    }
}

int query(int nod, int st, int dr, int stq, int drq)
{
    if(st >= stq && drq >= dr)
    {
        return aint[nod];
    }
    int m = (st+dr)/2, p1=0, p2=0;

    if(stq <= m)
        p1 = query(2*nod, st, m, stq, drq);

    if(drq > m)
        p2 = query(2*nod+1, m+1, dr, stq, drq);

    return p1 + p2;
}

int binarySearch(int p)
{
    int st = 1, dr = n, sol = -1;

    while (st <= dr)
    {
        int m = (st + dr) / 2;
        int free_spaces = query(1, 1, n, 1, m);

        if (free_spaces >= p)
        {
            sol = m;
            dr = m - 1;
        }
        else
        {
            st = m + 1;
        }
    }

    return sol;
}

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
        update(1, 1, n, i, 1);
    }

    for(int i=n; i>=1; i--)
    {
        int pos = binarySearch(v[i]);
        update(1, 1, n, pos, 0);
        ans[pos] = i;
    }

    for(int i=1; i<=n; i++)
        fout<<ans[i]<<'\n';

    return 0;
}