rt

#include<bits/stdc++.h>
#define re register
using namespace std;
const int N = 1e5 + 5,inf = 1e9 + 7;
struct node{
	int l,r;
	int key,size;
	int cnt,val;
}tr[N];
int root,idx;
int T;
inline void pushup(re int p)
{
	tr[p].size = tr[tr[p].l].size + tr[tr[p].r].size + tr[p].cnt;
}
inline void spin_right(re int &p)
{
	int q = tr[p].l;
	tr[p].l = tr[q].r, tr[q].r = p, p = q;
	pushup(p),pushup(tr[p].r);
}
inline void spin_left(re int &p)
{
	int q = tr[p].r;
	tr[p].r = tr[q].l, tr[q].l = p,p = q;
	pushup(p),pushup(tr[p].l);
}
inline int create_node(re int key)
{
	tr[++idx].key = key;
	tr[idx].val = rand();
	tr[idx].cnt = tr[idx].size = 1;
	return idx;
}
inline void build()
{
	create_node(-inf),create_node(inf);
	root = 1, tr[1].r = 2;
	pushup(root);
	if(tr[1].val < tr[2].val) spin_left(root);
}
inline void insert(re int &p,re int key)
{
	if(!p) p = create_node(key);
	else if(tr[p].key == key) ++tr[p].cnt;
	else if(tr[p].key > key)
	{
		insert(tr[p].l,key);
		if(tr[tr[p].l].val > tr[p].val) spin_right(p);
	}
	else
	{
		insert(tr[p].r,key);
		if(tr[tr[p].r].val < tr[p].val) spin_left(p);
	}
	pushup(p);
}
inline void remove(re int &p,re int key)
{
	if(!p) return;
	if(tr[p].key == key)
	{
		if(tr[p].cnt > 1) --tr[p].cnt;
		else if(tr[p].l || tr[p].r)
		{
			if(!tr[p].r || (tr[p].l && tr[tr[p].l].val > tr[tr[p].r].val))
			{
				spin_right(p),
				remove(tr[p].r,key);
			}
			else
			{
				spin_left(p), 
				remove(tr[p].l,key);
			}
		}
		else p = 0;
	}
	else if(tr[p].key > key) remove(tr[p].l,key);
	else remove(tr[p].r,key);
	pushup(p);
}
inline int get_rank_by_key(re int p,re int key)
{
	if(!p) return 0;
	if(tr[p].key == key) return tr[tr[p].l].size + 1;
	if(tr[p].key > key) return get_rank_by_key(tr[p].l,key);
	return tr[tr[p].l].size + tr[p].cnt + get_rank_by_key(tr[p].r,key);
}
inline int get_key_by_rank(re int p,re int rank)
{
	if(!p) return inf;
	if(tr[tr[p].l].size >= rank) return get_key_by_rank(tr[p].l,rank);
	if(tr[tr[p].l].size + tr[p].cnt >= rank) return tr[p].key;
	return get_key_by_rank(tr[p].r,rank - tr[tr[p].l].size - tr[p].cnt);
}
inline int get_front(re int p,re int key)
{
	if(!p) return -inf;
	if(tr[p].key >= key) return get_front(tr[p].l,key);
	return max(tr[p].key,get_front(tr[p].r,key));
}
inline int get_next(re int p,re int key)
{
	if(!p) return inf;
	if(tr[p].key <= key) return get_next(tr[p].r,key);
	return min(tr[p].key,get_next(tr[p].l,key));
}
int main()
{
	freopen("balance-tree.in","r",stdin);
//	freopen("balance-tree.out","w",stdout);
	build();
	scanf("%d",&T);
	re int op,x;
	while(T--)
	{
		scanf("%d%d",&op,&x);
		if(op == 1) insert(root,x);
		else if(op == 2) remove(root,x);
		else if(op == 3) printf("%d\n",get_rank_by_key(root,x) - 1);
		else if(op == 4) printf("%d\n",get_key_by_rank(root,x + 1));
		else if(op == 5) printf("%d\n",get_front(root,x));
		else if(op == 6) printf("%d\n",get_next(root,x));
	}
	return 0;
}