#include <bits/stdc++.h>
#define in "schi.in"
#define out "schi.out"
#define nmax 30003
using namespace std;
ifstream fin(in);
ofstream fout(out);

int n;
int aib[nmax];
int a[nmax],sol[nmax];

int Query(int k)
{
    int s = 0;

    while (k > 0)
    {
        s += aib[k];
        k -= (k & (-k));
    }

    return s;
}

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

int CautBin(int s)
{
    int st,dr,mj,sol = -1, v;

    st = 1; dr = n;
    while (st <= dr)
    {
        mj = (st+dr)/2;

        v = Query(mj);
        if (s == v)
        {
            sol = mj;
            dr = mj - 1;
        }
        else if (v < s) st = mj + 1;
             else dr = mj - 1;
    }

    return sol;
}

int main()
{
    int i;

    fin >> n;
    for (i = 1; i <= n; i++)
    {
        fin >> a[i];
        Update(i,1);
    }

    for (i = n; i >= 1; i--)
    {
        int p = CautBin(a[i]);
        sol[p] = i;
        Update(p, -1);
    }

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

    fin.close();
    fout.close();
    return 0;
}