#include<iostream>

#include<cstdio>

#include<cstdio>

using namespace std;

const int maxn=;

int small[maxn],ans[maxn];

struct node{

    int lc,rc,len;

};

node tree[maxn*];//这里一开始数组开小了出现了rte

void build(int x,int lc,int rc){

    tree[x].lc=lc,tree[x].rc=rc;

    tree[x].len=rc-lc+;

    if(lc==rc)return ;

    build(x*,lc,(lc+rc)/);

    build(x*+,(lc+rc)/+,rc);

}

int query(int base,int k){

    tree[base].len--;

    if(tree[base].lc==tree[base].rc)return tree[base].lc;

    if(k<=tree[base*].len){

        return query(base*,k);

    }

    else{

        return query(base*+,k-tree[base*].len);

    }

}

int main(void){

    int n;

    scanf("%d",&n);

    for(int i=;i<=n;i++){

        scanf("%d",&small[i]);

    }

    small[]=;

    build(,,n);

    for(int i=n;i>=;i--){

        ans[i]=query(,small[i]+);

    }

    for(int i=;i<=n;i++){

        printf("%d\n",ans[i]);

    }

    return ;

}