#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;inline int read(){    int x=0; char ch=getchar();    while (ch<‘0‘ || ch>‘9‘) {ch=getchar();}    while (ch>=‘0‘ && ch<=‘9‘) {x=x*10+ch-‘0‘; ch=getchar();}    return x;}#define MAXN 100010int N,pos[MAXN];struct Node{int id,t;}a[MAXN];inline bool cmp(Node A,Node B) {return A.id==B.id? A.t<B.t:A.id<B.id;}namespace SplayTree{    int size[MAXN],root,sz,fa[MAXN],son[MAXN][2]; bool rev[MAXN];    #define ls(x) son[x][0]    #define rs(x) son[x][1]    inline void Update(int now) {size[now]=size[ls(now)]+size[rs(now)]+1;}    inline void PushDown(int now)    {        if (!rev[now]) return;        rev[ls(now)]^=1; rev[rs(now)]^=1; swap(ls(now),rs(now)); rev[now]=0;    }    inline bool Right(int now) {return son[fa[now]][1]==now;}    inline void rotate(int now)        {        PushDown(fa[now]); PushDown(now);        int f=fa[now],gf=fa[f],wh=Right(now);        son[f][wh]=son[now][wh^1]; fa[son[f][wh]]=f;        fa[f]=now; son[now][wh^1]=f; fa[now]=gf;        if (gf) son[gf][son[gf][1]==f]=now;        Update(f); Update(now);    }    inline void splay(int now,int tar)    {        for (int f; (f=fa[now])!=tar; rotate(now))            if (fa[f]!=tar) rotate(Right(now)==Right(f)? f:now);        if (!tar) root=now;        }    inline int GetX(int k)    {        int x=root;        while (1)            {                PushDown(x);                if (k<=size[ls(x)]) x=ls(x);                    else if (k==size[ls(x)]+1) return x;                        else k-=size[ls(x)]+1,x=rs(x);            }        return -1;    }    inline int GetK(int x) {splay(x,0); return size[ls(x)];}    inline int BuildTree(int l,int r,int last)    {        if (r<l) return 0;        int mid=(l+r)>>1,now=++sz;        pos[a[mid].id]=now; fa[now]=last;        int lson=BuildTree(l,mid-1,now),rson=BuildTree(mid+1,r,now);        son[now][0]=lson; son[now][1]=rson;        Update(now);        return now;    }    inline void Reverse(int l,int r) {splay(l,0),splay(r,l); rev[ls(rs(root))]^=1;}    inline void Init() {root=BuildTree(1,N+2,0);}}int main(){    N=read();    for (int i=2,t=0; i<=N+1; i++) a[i].id=read(),a[i].t=++t;    a[1].id=0; a[N+2].id=N+2;     stable_sort(a+2,a+N+2,cmp);    for (int i=1; i<=N; i++) a[a[i+1].t+1].id=i;//    for (int i=1; i<=N+2; i++) printf("%d ",a[i].id); puts("");    SplayTree::Init();    for (int i=1; i<=N; i++)        {            int loc=SplayTree::GetK(pos[i]);            int x=SplayTree::GetX(i),y=SplayTree::GetX(loc+2);//            printf("%d %d\n",x,y);            SplayTree::Reverse(x,y);            printf("%d%c",loc,i!=N? ‘ ‘:‘\n‘);        }    return 0;}