#include <cstdio>
#include <algorithm>
using namespace std;

int v[30005], sol[30005], aib[30005], aib2[30005];

void update(int pos, int x, int n){
    for(;pos <= n;pos += pos&(-pos)){
        aib[pos] += x;
    }
}

int query(int pos){
    int ret = 0;
    for(;pos > 0;pos -= pos&(-pos)){
        ret += aib[pos];
    }
    return ret;
}

void update2(int pos, int x, int n){
    for(;pos <= n;pos += pos&(-pos)){
        aib2[pos] += x;
    }
}

int query2(int pos){
    int ret = 0;
    for(;pos > 0;pos -= pos&(-pos)){
        ret += aib2[pos];
    }
    return ret;
}

int binarySearch(int lf, int rg, int x){
    int i,step;
    for(step = 1;step <= rg;step <<= 1);
    for(i = lf-1;step;step >>= 1){
        if(i + step <= rg && query(i + step) <= x){
            i += step;
        }
    }
    return i;
}

int main(){
    freopen("schi.in", "r", stdin);
    freopen("schi.out", "w", stdout);
    int n,i,pos,x;
    scanf("%d", &n);
    for(i = 1;i <= n;i++){
        scanf("%d", &v[i]);
        update(i, 1, n);
    }
    for(i = n;i >= 1;i--){
        x = v[i] + query2(v[i]);
        if(sol[x] == 0){
            sol[x] = i;
            pos = x;
        }else{
            pos = binarySearch(1, n, query(x)) + 1;
            sol[pos] = i;
        }

        update(pos, -1, n);
        update2(v[i], 1, n);
    }
    for(i = 1;i <= n;i++){
        printf("%d\n", sol[i]);
    }
    return 0;
}