#include <iostream>
using namespace std;
const int N=1e8+10;
int n,root,cnt,op,x;
struct csp{
	int left,right,len,value,num;
	csp(int l,int r,int s,int v):left(l),right(r),len(s),value(v),num(1){};
	csp(){}
}tree[N];
inline void update(int root){
	tree[root].len=tree[tree[root].left].len+tree[tree[root].right].len+tree[root].num;
}
int solve(int x,int root){
	if(root){
		if(x<tree[root].value) return solve(x,tree[root].left);
		if(x>tree[root].value) return solve(x,tree[root].right)+tree[tree[root].left].len+tree[root].num;
		return tree[tree[root].left].len+tree[root].num;
	}
	return 1;
}
int kth(int x,int root){
	if(x<=tree[tree[root].left].len) return kth(x,tree[root].left);
	if(x<=tree[tree[root].left].len+tree[root].num) return tree[root].value;
	return kth(x-tree[tree[root].left].len-tree[root].num,tree[root].right);
}
int insert(int x,int &root){
	if(x<tree[root].value)
		if(!tree[root].left) tree[tree[root].left=++cnt]=csp(0,0,1,x);
		else insert(x,tree[root].left);
	else if(x>tree[root].value)
		if(!tree[root].right) tree[tree[root].right=++cnt]=csp(0,0,1,x);
		else insert(x,tree[root].right);
	else tree[root].num++;
	update(root);
}
int main(){
	cin>>n;
	int num=0;
	tree[root=++cnt]=csp(0,0,1,2147483647);
	while(n--){
		cin>>op>>x;
		num++;
		if(op==1) cout<<solve(x,root)<<endl;
		else if(op==2) cout<<kth(x,root)<<endl;
		else if(op==3) cout<<kth(solve(x,root)-1,root)<<endl;
		else if(op==4) cout<<kth(solve(x+1,root),root)<<endl;
		else{
			num--;
			insert(x,root);
		}
	}
	return 0;
}

情况