#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10, M = 1e6 + 10, INF = 1e9 + 10;
int n, m, w[N];
int root, idx;
struct Node {
	int s[2], v, p;
	int size;
	void init(int _v, int _p)
	{
		v = _v, p = _p;
		size = 1;
	}
}tr[N + M];
void pushup(int x)
{
	tr[x].size = tr[tr[x].s[0]].size + tr[tr[x].s[1]].size + 1;
}
void rotate(int x)
{
	int y = tr[x].p, z = tr[y].p;
	int k = tr[y].s[1] == x;
	tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z;
	tr[y].s[k] = tr[x].s[k ^ 1], tr[tr[x].s[k ^ 1]].p = y;
	tr[x].s[k ^ 1] = y, tr[y].p = x;
	pushup(y), pushup(x);
}
void splay(int x, int k)
{
	while (tr[x].p != k) {
		int y = tr[x].p, z = tr[y].p;
		if (z != k)
			if ((tr[y].s[1] == x) ^ (tr[z].s[1] == y))rotate(x);
			else rotate(y);
		rotate(x);
	}
	if (!k)root = x;
}
void insert(int v)
{
	int u = root, p = 0;
	while (u)p = u, u = tr[u].s[v > tr[u].v];
	u = ++idx;
	if (p)tr[p].s[v > tr[p].v] = u;
	tr[u].init(v, p);
	splay(u, 0);
}
void del(int v)
{
	int u = root, pos = 0;
	while (u) {
		if (v >= tr[u].v)pos = u, u = tr[u].s[1];
		else u = tr[u].s[0];
	}
	splay(pos, 0);
	int l = tr[pos].s[0], r = tr[pos].s[1];
	while (tr[l].s[1])l = tr[l].s[1];
	while (tr[r].s[0])r = tr[r].s[0];
	splay(l, 0), splay(r, l);
	tr[r].s[0] = 0;
	pushup(r), pushup(l);
}
int get_r(int v)
{
	int u = root, res = 0, pos = 0;
	while (u) {
		if (v > tr[u].v)res += tr[tr[u].s[0]].size + 1, pos = u, u = tr[u].s[1];
		else u = tr[u].s[0];
	}
	splay(pos, u);
	return res;
}
int get_k(int k)
{
	int u = root;
	while (u) {
		if (k < tr[tr[u].s[0]].size + 1)u = tr[u].s[0];
		else if (k == tr[tr[u].s[0]].size + 1)break;
		else k -= tr[tr[u].s[0]].size + 1, u = tr[u].s[1];
	}
	splay(u, 0);
	return tr[u].v;
}
int get_pre(int v)
{
	int u = root, res = -INF, pos = 0;
	while (u) {
		if (v > tr[u].v) {
			if (res < tr[u].v)res = tr[u].v, pos = u;
			u = tr[u].s[1];
		}
		else u = tr[u].s[0];
	}
	splay(pos, 0);
	return res;
}
int get_next(int v)
{
	int u = root, res = INF, pos = 0;
	while (u) {
		if (v < tr[u].v) {
			if (res > tr[u].v)res = tr[u].v, pos = u;
			u = tr[u].s[0];
		}
		else u = tr[u].s[1];
	}
	splay(pos, 0);
	return res;
}
int main()
{
	//scanf("%d%d", &n, &m);
	scanf("%d", &m);
	insert(-INF), insert(INF);
	//for (int i = 1; i <= n; i++)scanf("%d", &w[i]),insert(w[i]);
	int last = 0, ans = 0;
	while (m--)
	{
		int op, x;
		scanf("%d%d", &op, &x);
		if (op == 1)insert(x);
		else if (op == 2)del(x);
		else if (op == 3) {
			//x ^= last;
			last = get_r(x);
			//ans ^= last;
			printf("%d\n", last);
		}
		else if (op == 4) {
			//x ^= last;
			last = get_k(x + 1);
			//ans ^= last;
			printf("%d\n", last);
		}
		else if (op == 5) {
			//x ^= last;
			last = get_pre(x);
			//ans ^= last;
			printf("%d\n", last);
		}
		else {
			//x ^= last;
			last = get_next(x);
			//ans ^= last;
			printf("%d\n", last);
		}
		//printf(":%d\n", last);
	}
	//printf("%d\n", ans);
	return 0;
}