#include <bits/stdc++.h>
#define N 30008

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

int n;
int v[N];
int T[4 * N];
int sol[N];

void initializare( int left, int right, int nod )
{
    if( left == right ) {
        T[nod] = 1;
        return;
    }
    int pivot = ( left + right ) / 2;
    initializare( left, pivot, nod << 1 );
    initializare( pivot + 1, right, nod << 1|1 );

    T[nod] = T[nod << 1] + T[nod << 1|1];
}

void update( int left, int right, int nod, int x, int poz )
{
    if( left == right )
        T[nod] = 0, sol[left] = poz;
    else
    {
        int pivot = ( left + right ) / 2;
        if( x <= T[nod << 1] )
            update( left, pivot, nod << 1, x, poz );
        else
            update( pivot + 1, right, nod << 1|1, x - T[nod << 1], poz );

        T[nod] = T[nod << 1] + T[nod << 1|1];
    }
}

void Citire()
{
    int i;
    fin >> n;
    for( i=1; i<=n; i++ )
        fin >> v[i];
    initializare( 1, n, 1 );
}

void Rezolvare()
{
    int i;
    for( i=n; i>0; i-- )
        update( 1, n, 1, v[i], i );

    for( i=1; i<=n; i++ )
        fout << sol[i] << "\n";
}

int main()
{
    Citire();
    Rezolvare();
    //cout << sizeof( Lee ) / 1024.0 / 1024.0;
    return 0;
}