#include <fstream>
using namespace std;
ifstream cin ("schi.in");
ofstream cout ("schi.out");
int aint[400005], v[30005], ans[30005];
void update(int nod, int st, int dr, int x, int val)
{
   if(st > x || dr < x)
      return;
   if(st == dr && st == x)
   {
      aint[nod] += val;
      return;
   }
   int mid = (st + dr) / 2;
   update(nod * 2, st, mid, x, val);
   update(nod * 2 + 1, mid + 1, dr, x, val);
   aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
int query(int nod, int st, int dr, int x)
{
   if(st == dr)
      return st;
   int mid = (st + dr) / 2;
   if(aint[nod * 2] < x)
      return query(nod * 2 + 1, mid + 1, dr, x - aint[nod * 2]);
   return query(nod * 2, st, mid, x);
}
int main()
{
    int n, m, i;
    cin >> n;
    for(i = 1; i <= n; i ++)
    {
        cin >> v[i];
        update(1, 1, n, i, 1);
    }
    for(i = n; i >= 1; i --)
    {
       int poz = query(1, 1, n, v[i]);
       update(1, 1, n, poz, -1);
       ans[poz] = i;
    }
    for(i = 1; i <= n; i ++)
      cout << ans[i] << '\n';
    return 0;
}