#include<bits/stdc++.h>

struct FHQ_treap{
	struct fhq_treap{
		int l,r,val,siz,dat;
	}tree[500005];
	int root=0,tot=0;
	inline void update(int x){
		tree[x].siz=tree[tree[x].l].siz+tree[tree[x].r].siz+1;
		return ;
	}
	inline int newnode(int x){
		tree[++tot].val=x;
		tree[tot].siz=1;
		tree[tot].dat=rand();
		return tot;
	}
	inline void split(int k,int key,int &x,int &y){
		if(k==0){
			x=y=0;
			return ;
		}
		if(tree[k].val<=key){
			x=k;
			split(tree[x].r,key,tree[x].r,y);
		}
		else{
			y=k;
			split(tree[y].l,key,x,tree[y].l);
		}
		update(k);
	}
	inline int merge(int x,int y){
		if(x==0){
			return y;
		}
		if(y==0){
			return x;
		}
		if(tree[x].dat>tree[y].dat){
			tree[x].r=merge(tree[x].r,y);
			update(x);
			return x;
		}
		else{
			tree[y].l=merge(x,tree[y].l);
			update(y);
			return y;
		}
	}
	inline void insert(int key){
		int x,y;
		split(root,key-1,x,y);
		int id=newnode(key);
		root=merge(merge(x,id),y);
		return ;
	}
	inline void remove(int key){
		int x,y,z;
		split(root,key-1,x,y);
		split(y,key,y,z);
		if(y){
			y=merge(tree[y].l,tree[y].r);
		}
		root=merge(merge(x,y),z);
		return ;
	}
	inline int rnk(int key){
		int x,y,ans;
		split(root,key-1,x,y);
		ans=tree[x].siz+1;
		root=merge(x,y);
		return ans;
	}
	inline int kth(int rnk){
		int p=root;
		while(1){
			if(tree[tree[p].l].siz+1==rnk){
				break;
			}
			else if(tree[tree[p].l].siz+1>rnk){
				p=tree[p].l;
			}
			else{
				rnk-=tree[tree[p].l].siz+1;
				p=tree[p].l;
			}
		}
		return tree[p].val;
	}
	inline int pre(int key){
		int x,y,p;
		split(root,key-1,x,y);
		p=x;
		while(tree[p].r!=0){
			p=tree[p].r;
		}
		root=merge(x,y);
		return tree[p].val;
	}
	inline int next(int key){
		int x,y,p;
		split(root,key-1,x,y);
		p=y;
		while(tree[p].l!=0){
			p=tree[p].l;
		}
		root=merge(x,y);
		return tree[p].val;
	}
}treap;
int n;
int main(){
	srand(time(0));
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int opt,x;
		scanf("%d%d",&opt,&x);
		if(opt==1){
			treap.insert(x);
		}
		else if(opt==2){
			treap.remove(x);
		}
		else if(opt==3){
			printf("%d\n",treap.rnk(x));
		}
		else if(opt==4){
			printf("%d\n",treap.kth(x));
		}
		else if(opt==5){
			printf("%d\n",treap.pre(x));
		}
		else{
			printf("%d\n",treap.next(x));
		}
	}
}