#include <iostream>
#include <fstream>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
int n, v[30005], t[30005], fi[30005], suma[30008];
void update (int l, int r, int nod,int val,int i)
{
    if(l==r)
    {   suma[nod]-=(v[l]-val);
        return;
    }
    int mid=(l+r)/2;
    if(i<mid)
        update(l, mid, 2*nod, val, i);
    else
        update(mid+1,r, 2*nod+1, val, i);
   suma[nod]-=(v[l]-val);
}
void citire ()
{
    f>>n;
    int i;
    for(i=1;i<=n;++i)
    {
        f>>v[i];
        t[i]=1;
        update(1,n, 1, 1, i);
    }
    f.close();
}
int query (int nod, int l, int r, int dr, int st)
{
    if(l<=st && r<=dr)  return suma[nod];
    if(l>dr || r<st)    return 0;
    int mid=(l+r)>>1;
    int val1=query(2*nod,l, mid, st, dr);
    int val2=query(2*nod+1, mid+1, r, st, dr);
}
int cautareBin(int val)
{
    int li=1, ls=n, mid;
    while(li<=ls)
    {
        mid=(li+ls)>>1;
        int s=query(1,li, ls, 1, n);
        if(s==val)
            return mid;
        if(val>s)    li=mid+1;
        else   ls=mid-1;
    }
    return 0;
}
int main()
{   citire();
    int i;
    fi[v[n]]=n;
    t[v[n]]=0;
    update(1,n, 1, 0, n);
    for(i=n-1;i>=1;--i)
    {
        int j;
        j=cautareBin(v[i]);
        update(1, n, 1, 0, j);
        fi[j]=i;
        t[j]=0;
    }
    for(i=1;i<=n;++i)
        g<<fi[i]<<'\n';
    g.close();
}