#include <bits/stdc++.h>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
/**
8
1 1 3 4 4 2 1 3


      1 2 3 4 5 6 7 8
aib = 0 1 0 1 0 0 1 1

*/

int aib[30002], n, a[30002], cls[30002];

void Update(int p, int x)
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int suma = 0;
    while (p > 0)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}

/// ret. cea mai din stanga pozitie p
/// cu suma(1..p) = val
int CautBin(int val)
{
    int x, st, dr, mij, p;
    st = 1; dr = p = n;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        x = Query(mij);
        if (x == val)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (x > val) dr = mij - 1;
        else st = mij + 1;
    }
    return p;
}

int main()
{
    int i, p;
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];

    /// facem 1 peste tot in aib:
    for (i = 1; i <= n; i++)
        Update(i, 1);

    for (i = n; i >= 1; i--)
    {
        p = CautBin(a[i]);
        cls[p] = i;
        Update(p, -1);
    }
    for (i = 1; i <= n; i++)
        fout << cls[i] << "\n";
    return 0;
}