#include <iostream>
#define pc putchar
using namespace std;
const int N = 1e5 + 10, inf = 1e9;
int fa[N], son[N][2], siz[N], cntq[N], val[N], cnt = 0, rt = 0;

void push_up (int x) { siz[x] = siz[son[x][0]] + siz[son[x][1]] + cntq[x]; }
int get (int x) { return x == son[fa[x]][1]; }
int compare (int x, int k) { return k > val[x]; }
void rotate (int x)
{
	int y = fa[x], z = fa[y], p = get (x);
	son[y][p] = son[x][p ^ 1];
	if (son[x][p ^ 1]) fa[son[x][p ^ 1]] = y;
	fa[fa[son[x][p ^ 1] = y] = x] = z;
	if (z) son[z][y == son[z][1]] = x;
	push_up (y), push_up (x);
}

int splay (int x, int t = 0)
{
	for (int f = fa[x]; (f = fa[x]) != t; rotate (x))
		if (fa[f] != t) rotate (get (x) == get (f) ? f : x);
	return t ? x : rt = x;
}

int insert_at (int f, int k)
{
	++cnt, fa[cnt] = f, siz[cnt] = cntq[cnt] = 1, val[cnt] = k;
	if (f) son[f][compare (f, k)] = cnt;
	return cnt;
}

void insert (int k)
{
	int f = rt, last = 0;
	if (!f) return rt = insert_at (0, k), void ();
	while (f && val[f] != k) last = f, f = son[f][compare (f, k)];
	if (f && val[f] == k) siz[f]++, cntq[f]++;
	else f = insert_at (last, k);
	splay (f);
}

int find (int k)
{
	int f = rt;
	if (!f) return 0;
	while (val[f] != k && son[f][compare (f, k)]) f = son[f][compare (f, k)];
	return splay (f);
}

int qrank (int k)
{
	return siz[son[find (k)][0]] + (val[rt] < k ? cntq[rt] : 0);
}

int kth (int k)
{
	int f = rt;
	while (f)
		if (k <= siz[son[f][0]]) f = son[f][0];
		else if (k <= siz[son[f][0]] + cntq[f]) return splay (f);
		else k -= siz[son[f][0]] + cntq[f], f = son[f][1];
	return 0;
}

int merge (int x, int y)
{
	int f = x;
	if (!x || !y) return x + y;
	while (son[f][1]) f = son[f][1];
	fa[son[splay (f, fa[x])][1] = y] = f;
	return f;
}

void remove (int k)
{
	int f = find (k), x;
	if (cntq[f] > 1) return cntq[f]--, siz[f]--, void ();
	if ((x = merge (son[f][0], son[f][1]))) fa[x] = 0;
	rt = x;
}

int qpre (int k)
{
	int f = son[find (k)][0];
	if (val[rt] < k) return rt;
	while (son[f][1]) f = son[f][1];
	return splay (f);
}

int qnxt (int k)
{
	int f = son[find (k)][1];
	if (val[rt] > k) return rt;
	while (son[f][0]) f = son[f][0];
	return splay (f);
}

int read (void)
{
	int res = 0, s = 1;
	char c;
	while (!isdigit (c = getchar ())) if (c == '-') s = -1;
	do res = res * 10 + c - '0'; while (isdigit (c = getchar ()));
	return res * s;
}

void write (int x)
{
	char s[60];
	int i = 0;
	if (x < 0) pc ('-'), x = -x;
	do s[++i] = x % 10 + '0', x /= 10; while (x);
	while (i) pc (s[i--]);
	pc ('\n');
}

int main (void)
{
	int n = read ();
		
	insert (inf), insert (-inf);
	while (n--) {
		int t = read (), k = read ();
		switch (t) {
		case 1: insert (k); break;
		case 2: remove (k); break;
		case 3: write (qrank (k)); break;
		case 4: write (val[kth (k + 1)]); break;
		case 5: write (val[qpre (k)]); break;
		case 6: write (val[qnxt (k)]); break;
		}
	}
	return 0;
}