#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 500010
#define inf 2147483647
#define pii pair<int,int>
#define lson tree[k].ch[0]
#define rson tree[k].ch[1]
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{int x=0,f=1;char c=getchar();while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();return x*f;
}
int n,m,root[N],cnt;
struct data{int ch[2],x,p,s;
}tree[N<<6];
void up(int k){tree[k].s=tree[lson].s+tree[rson].s+1;}
int qnum(int k,int x)
{if (tree[lson].s+1==x) return tree[k].x;if (tree[lson].s+1>x) return qnum(lson,x);else return qnum(rson,x-tree[lson].s-1);
}
int qrank(int k,int x)
{if (!k) return 0;if (tree[k].x>=x) return qrank(lson,x);else return tree[lson].s+1+qrank(rson,x);
}
int qpre(int k,int x)
{if (!k) return -inf;if (tree[k].x>=x) return qpre(lson,x);else return max(tree[k].x,qpre(rson,x));
}
int qsuf(int k,int x)
{if (!k) return inf;if (tree[k].x<=x) return qsuf(rson,x);else return min(tree[k].x,qsuf(lson,x));
}
int merge(int x,int y)
{if (!x||!y) return x|y;int k=++cnt;if (tree[x].p>tree[y].p){tree[k]=tree[x];rson=merge(rson,y);}else{tree[k]=tree[y];lson=merge(x,lson);}up(k);return k;
}
pii split(int k,int x)
{if (!k) return make_pair(0,0);int u=++cnt;tree[u]=tree[k];if (tree[tree[u].ch[0]].s==x) return tree[u].ch[0]=0,up(u),make_pair(lson,u);if (tree[tree[u].ch[0]].s>x){pii v=split(tree[u].ch[0],x);return tree[u].ch[0]=v.second,up(u),make_pair(v.first,u);}else{pii v=split(tree[u].ch[1],x-tree[tree[u].ch[0]].s-1);return tree[u].ch[1]=v.first,up(u),make_pair(u,v.second);}
}
int newpoint(int x)
{cnt++;tree[cnt].x=x,tree[cnt].p=rand(),tree[cnt].s=1,tree[cnt].ch[0]=tree[cnt].ch[1]=0;return cnt;
}
int main()
{
#ifndef ONLINE_JUDGEfreopen("fhqtreap.in","r",stdin);freopen("fhqtreap.out","w",stdout);const char LL[]="%I64d\n";
#elseconst char LL[]="%lld\n";
#endifsrand(20020509);m=read();for (int i=1;i<=m;i++){int last=read(),op=read(),x=read();root[i]=root[last];switch (op){case 1:{int u=qrank(root[i],x),v=newpoint(x);pii p=split(root[i],u);root[i]=merge(merge(p.first,v),p.second);break;}case 2:{int p=qrank(root[i],x);if (qnum(root[i],p+1)==x){pii u=split(root[i],p),v=split(u.second,1);root[i]=merge(u.first,v.second);}break;}case 3:{printf("%d\n",qrank(root[i],x)+1);break;}case 4:{printf("%d\n",qnum(root[i],x));break;}case 5:{printf("%d\n",qpre(root[i],x));break;}case 6:{printf("%d\n",qsuf(root[i],x));break;}}//for (int j=1;j<=m;j++) cout<<root[j]<<' ';cout<<endl;//for (int j=1;j<=cnt;j++) cout<<tree[j].x<<' '<<tree[j].s<<' '<<tree[j].ch[0]<<' '<<tree[j].ch[1]<<endl;cout<<endl;
    }return 0;
}