#include<iostream>
#include<cstdio>
#define getchar() (*S++)
char B[1<<26],*S=B;
#define INF 2000000000
#define MN 100000
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;
}int n,fa[MN+5],val[MN+5],cnt=0,c[MN+5][2],rt=0,Q,s[MN+5],dep[MN+5],mn[MN+5],size[MN+5];inline void pushdown(int x)
{int l=c[x][0],r=c[x][1];val[l]+=val[x];dep[l]+=val[x];mn[l]+=val[x];val[r]+=val[x];dep[r]+=val[x];mn[r]+=val[x];val[x]=0;
}inline void update(int x)
{int l=c[x][0],r=c[x][1];size[x]=size[l]+size[r]+1;mn[x]=dep[x];if(l) mn[x]=min(mn[x],mn[l]);if(r) mn[x]=min(mn[x],mn[r]);
}void rotate(int x,int&k)
{int y=fa[x],z=fa[y],l=c[y][1]==x,r=l^1;if(y==k) k=x; else c[z][c[z][1]==y]=x;fa[x]=z;fa[y]=x;fa[c[x][r]]=y;c[y][l]=c[x][r];c[x][r]=y;update(y);update(x);
}void splay(int x,int&k)
{for(;x!=k;rotate(x,k))if(fa[x]!=k) rotate((c[fa[fa[x]]][1]==fa[x]^c[fa[x]][1]==x)?x:fa[x],k);
}void ins(int&x,int S,int d,int last)
{if(!x){x=++cnt;s[cnt]=S;dep[cnt]=mn[cnt]=d;size[cnt]=1;fa[cnt]=last;return;}ins(c[x][S>s[x]],S,d,x);update(x);
}int Find_Before(int x,int S)
{if(!x) return 0;if(val[x]) pushdown(x);if(s[x]>S) return Find_Before(c[x][0],S);return (Q=Find_Before(c[x][1],S))?Q:x;
}int Find_After(int x,int S)
{if(!x) return 0;if(val[x]) pushdown(x);if(s[x]<S) return Find_After(c[x][1],S);return (Q=Find_After(c[x][0],S))?Q:x;
}int Find(int x,int rk)
{if(val[x]) pushdown(x);int sz=size[c[x][0]]+1;if(sz==rk) return x;if(sz<rk) return Find(c[x][1],rk-sz);return Find(c[x][0],rk);
}int FindLeft(int x,int d)
{if(!x) return 0;if(val[x]) pushdown(x);if(min(mn[c[x][0]],dep[x])>=d) return FindLeft(c[x][1],d)+size[c[x][0]]+1;else return FindLeft(c[x][0],d);
}int FindRight(int x,int d)
{if(!x) return 0;if(val[x]) pushdown(x);if(min(mn[c[x][1]],dep[x])>=d) return FindRight(c[x][0],d)+size[c[x][1]]+1;else return FindRight(c[x][1],d);
}inline int Split(int l,int r)
{int Lt=Find(rt,l-1),Rt=Find(rt,r+1);splay(Lt,rt);splay(Rt,c[rt][1]);return c[c[rt][1]][0];
}inline void Modify(int l,int r,int ad)
{int y=Split(l,r);val[y]+=ad;mn[y]+=ad;dep[y]+=ad;
}void change(int x,int S)
{if(val[x]) pushdown(x);if(s[x]==S) dep[x]=1;else change(c[x][S>s[x]],S);update(x);
}int main()
{fread(B,1,1<<26,stdin);n=read();ins(rt,-INF,INF,0);ins(rt,INF,INF,0);mn[0]=INF;for(int i=1;i<=n;++i){int op=read();if(op==1){int x=read(),bef=Find_Before(rt,x),aft=Find_After(rt,x);int D=max(bef>2?dep[bef]:0,aft>2?dep[aft]:0)+1;ins(rt,x,D,0);splay(cnt,rt);printf("%d\n",D);}if(!(op&1)){int x=Find(rt,2),y=min(FindLeft(rt,dep[x]),size[rt]-1)-1;printf("%d\n",dep[x]);Modify(2,size[rt]-1,1);if(y>1) Modify(2,y+1,-1);change(rt,s[x]);}if((op&1)&&op>1){int x=Find(rt,size[rt]-1),y=min(FindRight(rt,dep[x]),size[rt]-1)-1;printf("%d\n",dep[x]);Modify(2,size[rt]-1,1);if(y>1) Modify(size[rt]-y,size[rt]-1,-1);change(rt,s[x]);}if(op>=4){if(op==4) splay(Find(rt,2),rt);else splay(Find(rt,size[rt]-1),rt);int l=(op==5),r=l^1,y=c[rt][l];c[y][r]=c[rt][r];fa[y]=0;fa[c[rt][r]]=y;rt=y;val[rt]-=1;update(rt);}}return 0;
}