#include <bits/stdc++.h>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int v[30001];
int ans[30001];
int tree[120001];
void build(int node,int st,int dr)
{
    if(st==dr)
    {
        tree[node]=1;
        return;
    }
    int mid=(st+dr)/2;
    build(2*node,st,mid);
    build(2*node+1,mid+1,dr);
    tree[node]=tree[2*node]+tree[2*node+1];
}
void update(int node,int st,int dr,int pos,int val)
{
    if(st==dr)
    {
        tree[node]+=val;
        return;
    }
    int mid=(st+dr)/2;
    if(pos<=mid)
    {
        update(2*node,st,mid,pos,val);
    }
    else
    {
        update(2*node+1,mid+1,dr,pos,val);
    }
    tree[node]=tree[2*node]+tree[2*node+1];
}
int query(int node,int st,int dr,int &pos,int idx)
{
    if(st==dr)
    {
        ans[st]=idx;
        return st;
    }
    int mid=(st+dr)/2;
    if(pos<=tree[2*node])
    {
        return query(2*node,st,mid,pos,idx);
    }
    else
    {
        pos-=tree[2*node];
        return query(2*node+1,mid+1,dr,pos,idx);
        pos+=tree[2*node];
    }
}
int main()
{
    int n,x;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    build(1,1,n);
    for(int i=n;i>=1;i--)
    {
        int pos=query(1,1,n,v[i],i);
        update(1,1,n,pos,-1);
    }
    for(int i=1;i<=n;i++)
    {
        fout<<ans[i]<<'\n';
    }
    return 0;
}