#include <bits/stdc++.h>

using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int aib[30001], a[30001], rezultat[30001];
unordered_map<int, int>M;
/**
  i     x     j
1 2 3 4 5 6 7 8
*/
int n, T, k;
void Add(int p, int c)
{
    while(p <= n)
    {
        aib[p] += c;
        p += (p & (-p));
    }
}
int Query(int p)
{
    int s = 0;
    while(p > 0)
    {
        s += aib[p];
        p -= (p & (-p));
    }
    return s;
}
int CbSt(int val)
{
    int st = 1, dr = n, p = -1, mij;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        int x = Query(mij);
        if(x >= val)
        {
            if(x == val)p = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return p;
}
int main()
{
    ios_base::sync_with_stdio(0);
    int i, p;
    fin >> n;
    for(i = 1; i <= n; i++)
    {
        fin >> a[i];
        Add(i, 1);
    }
    for(i = n; i >= 1; i--)
    {
        p = CbSt(a[i]);
        rezultat[p] = i;
        Add(p, -1);
    }
    for(i = 1; i <= n; i++)
        fout << rezultat[i] << "\n";
    return 0;
}