#include <fstream>
using namespace std;
ifstream fin("schi.in");
ofstream fout("schi.out");
int pozitie_om = 0;
struct node{
    int val;
    int left;
    int right;
};
node aint[1000001];
void build(int nod, int st, int dr, int val){
    if (val == 1){
        aint[nod].val = 1;
        aint[nod].left = st;
        aint[nod].right = dr;
        return;
    }
    int mid = (st + dr) / 2;
    build(2 * nod, st, mid, ((val / 2) + (val % 2)));
    build(2 * nod + 1, mid + 1, dr, (val / 2));
    aint[nod].val = val;
    aint[nod].left = st;
    aint[nod].right = dr;
}
void cauta_poz(int nod, int val){
    if (aint[nod].val == 1 && aint[2 * nod].val == 0 && aint[2 * nod + 1].val == 0){
        aint[nod].val--;
        pozitie_om = aint[nod].left;
        return;
    }
    aint[nod].val--;
    if (aint[2 * nod].val != 0 && val <= aint[2 * nod].val){
        cauta_poz(2 * nod, val);
    } else if (aint[2 * nod + 1].val != 0){
        cauta_poz(2 * nod + 1, (val - aint[2 * nod].val));
    }
}
int main(){
    int clasamente[30001];
    int oameni[30001];
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++){
        fin >> oameni[i];
    }
    build(1, 1, n, n);
    for (int om = n; om >= 1; om--){
        cauta_poz(1, oameni[om]);
        clasamente[pozitie_om] = om;
    }
    for (int i = 1; i <= n; i++){
        fout << clasamente[i] << '\n';
    }
    return 0;
}