//varianta cu arbori indexati binar
#include <cstdio>
#include <cstring>

#define step ((k ^(k-1)) & k)
#define MAX_N 30005

int V[MAX_N], A[MAX_N], Sol[MAX_N];
int N, viz[MAX_N];

void citire()
{
    scanf("%d",&N);

    for(int i = 1; i <= N; ++i)
        scanf("%d",V+i);
}

void update(int k, int val)
{
    while(k <= N)
    {
        A[k] += val;
        k += step;
    }
}

int s(int k)
{
    int rez = 0;
    while(k)
    {
        rez += A[k];
        k -= step;
    }
    return rez;
}

int querry(int k)
{
    int i, pas;
    for(pas = 1; pas < N; pas <<= 1);

    for(i = N; pas; pas >>= 1)
        if(i - pas >= 1)
            if(k <= s(i - pas))
                i -= pas;
    return i;
}

void solve()
{
    for(int i = 1; i <= N; ++i)
        update(i, 1);

    for(int i = N; i; i--)
    {
        int q = querry(V[i]);
        Sol[q] = i;
        update(q,-1);
    }
    for(int i = 1; i <= N; ++i)
        printf("%d\n",Sol[i]);
}

int main()
{
    freopen("schi.in","rt",stdin);
    freopen("schi.out","wt",stdout);
    citire();
    solve();
}