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

/**
8
1 1 3 4 4 2 1 3

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

      1 2 3 4 5 6 7 8
loc = 7   8 6
*/

ifstream fin("schi.in");
ofstream fout("schi.out");
int aib[30003], n, loc[30003], a[30003];

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

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

/// ret. cea mai mica pozitie p cu a[1]+...+a[p]=x
/// sau ret. -1, daca nu exista o astfel de pozitie
int CautBin(int x)
{
    int st, dr, mij, p, suma;
    st = 1; dr = n; p = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        suma = Query(mij);
        if (suma == x)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (suma < x) st = mij + 1;
        else dr = mij - 1;
    }
    return p;
}

int main()
{
    int i, m, x, y, p, op;
    fin >> n;
    for (i = 1; i <= n; i++)
        Update(i, 1);
    for (i = 1; i <= n; i++)
        fin >> a[i];
    for (i = n; i >= 1; i--)
    {
        p = CautBin(a[i]);
        loc[p] = i;
        Update(p, -1);
    }
    for (i = 1; i <= n; i++)
        fout << loc[i] << "\n";
    return 0;
}