#include <bits/stdc++.h>
using namespace std;
const int nm=30005;
int v[nm];
int aint[4*nm];
int sol[nm];

void build(int nod,int st,int dr){
    if(st==dr){
        aint[nod]=1;
    }
    else{
        int mid=(st+dr)/2;
        build(2*nod,st,mid);
        build(2*nod+1,mid+1,dr);
        aint[nod]=aint[2*nod]+aint[2*nod+1];
    }
}
void update(int nod,int st,int dr,int x,int val){
    if(st==dr){
        aint[nod]-=val;
    }
    else{
        int mid=(st+dr)/2;
        if(x>mid){
            update(2*nod+1,mid+1,dr,x,val);
        }
        else update(2*nod,st,mid,x,val);
        aint[nod]-=val;
    }
}

int query(int nod,int st,int dr,int x,int y)
{
    if(st>=x && y>=dr){
        return aint[nod];
    }
    else{
        int mid=(st+dr)/2;
        int L=0;
        if(x<=mid){
            L=query(2*nod,st,mid,x,y);

        }
        int R=0;
        if(mid+1<=y){
            R=query(2*nod+1,mid+1,dr,x,y);
        }
        return R+L;
    }
}
int main(){
    ifstream cin("schi.in");
    ofstream cout("schi.out");
    int n,m;
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> v[i];
    }
    build(1,1,n);
    for(int i = n; i >= 1; i--) {
        int st = 1;
        int dr = n;
        int pos = 0;
        while(st <= dr) {
            int mid = (st + dr) / 2;
            if(query(1, 1, n, 1, mid) == v[i]) {
                pos = mid;
                dr = mid - 1;
            } else {
                if(query(1, 1, n, 1, mid) > v[i]) {
                    dr = mid - 1;
                } else {
                    st = mid + 1;
                }
            }
        }
        //cout << i << ' ' << pos << '\n';
        sol[pos] = i;
        update(1, 1, n, pos, 1);
    }
    for(int i = 1; i <= n; i++) {
        cout << sol[i] << '\n';
    }
    return 0;
}