#include <bits/stdc++.h>

using namespace std;
 
#define plm(a) (a & -a)
#define MAXN 30005
 
int N, a[30005], aib[30005], sol[30005], plm1;

void upd(int pos, int val) {
    for (int i = pos; i <= N; i += plm(i)) {
        aib[i] += val;
    }
}

int main() {
    f >> N; 
    for (int i = 1; i <= N; ++i) {
        cin >> a[i];
        upd(i, 1);
    }
 
    for (plm1 = 1; plm1 <= N; plm1 <<= 1);
 
    for (int i = N; i > 0; --i) {
        int pos = 0;
 
        for (int j = plm1; j > 0; j >>= 1) {
            if (pos + j <= N && aib[pos + j] < a[i]) {
                pos += j;
                x -= aib[pos];
            }
        }
 
        sol[pos + 1] = i;
        upd(pos + 1, -1);
    }
 
    
    for (int i = 1; i <= N; ++i) {
        g << sol[i] << '\n';
    }
 
    return 0;
}