#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <list>
#include <queue>
//#include <conio.h>
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define newl printf("\n")
#define NMAX 30005
#define nst (nod<<1)
#define ndr (nst+1)
using namespace std;
int n,v[NMAX],tree[NMAX<<2],sol[NMAX];
void build(int nod,int st,int dr)
{
    tree[nod]=dr-st+1;
    if (st==dr) return;
    int mid=(st+dr)>>1;
    build(nst,st,mid);
    build(ndr,mid+1,dr);
}
void update(int nod,int st,int dr,int pos)
{
    if (st==dr)
    {
        tree[nod]--;
        return;
    }
    int mid=(st+dr)>>1;
    if (pos<=mid) update(nst,st,mid,pos);
    else update(ndr,mid+1,dr,pos);
    tree[nod]=tree[nst]+tree[ndr];
}
int query(int nod,int st,int dr,int pos)
{
    if (st==dr) return st;
    int mid=(st+dr)>>1;
    if (pos<=tree[nst]) return query(nst,st,mid,pos);
    else return query(ndr,mid+1,dr,pos-tree[nst]);
}
int main()
{
    freopen("schi.in","r",stdin);
    freopen("schi.out","w",stdout);
    scanf("%d",&n);
    build(1,1,n);
    for (int i=1;i<=n;i++) scanf("%d",&v[i]);
    for (int i=n;i>0;i--)
    {
        int pos=query(1,1,n,v[i]);
        sol[pos]=i;
        update(1,1,n,pos);
    }
    for (int i=1;i<=n;i++) printf("%d\n",sol[i]);
    return 0;
}