#include <bits/stdc++.h>
#define io cin.tie(0), cout.tie(0), ios::sync_with_stdio(false)
#define LL long long
#define ULL unsigned long long
#define EPS 1e-8
#define INF 0x7fffffff
#define SUB -INF - 1
using namespace std;
const int M = 1000010;
int cnt = 0;
struct Node
{
    int ls, rs;
    int key, pri;
    int size;
} t[M];
void newNode(int x)
{
    cnt++;
    t[cnt].size = 1;
    t[cnt].ls = t[cnt].rs = 0;
    t[cnt].key = x;
    t[cnt].pri = rand();
}
void update(int u)
{
    t[u].size = t[t[u].ls].size + t[t[u].rs].size + 1;
}
void rotate(int &o, int d)
{
    int k;
    if (d == 1)
    {
        k = t[o].rs;
        t[o].rs = t[k].ls;
        t[k].ls = o;
    }
    else
    {
        k = t[o].ls;
        t[o].ls = t[k].rs;
        t[k].rs = o;
    }
    t[k].size = t[o].size;
    update(o);
    o = k;
}
void Insert(int &u, int x)
{
    if (u == 0)
    {
        newNode(x);
        u = cnt;
        return;
    }
    t[u].size++;
    if (x >= t[u].key)
        Insert(t[u].rs, x);
    else
        Insert(t[u].ls, x);
    if (t[u].ls != 0 && t[u].pri > t[t[u].ls].pri)
        rotate(u, 0);
    if (t[u].rs != 0 && t[u].pri > t[t[u].rs].pri)
        rotate(u, 1);
    update(u);
}
void Del(int &u, int x)
{
    t[u].size--;
    if (t[u].key == x)
    {
        if (t[u].ls == 0 && t[u].rs == 0)
        {
            u = 0;
            return;
        }
        if (t[u].ls == 0 || t[u].rs == 0)
        {
            u = t[u].ls + t[u].rs;
            return;
        }
        if (t[t[u].ls].pri < t[t[u].rs].pri)
        {
            rotate(u, 0);
            Del(t[u].rs, x);
            return;
        }
        else
        {
            rotate(u, 1);
            Del(t[u].ls, x);
            return;
        }
    }
    if (t[u].key >= x)
        Del(t[u].ls, x);
    else
        Del(t[u].rs, x);
    update(u);
}
int Rank(int u, int x)
{
    if (u == 0)
        return 0;
    if (x > t[u].key)
        return t[t[u].ls].size + 1 + Rank(t[u].rs, x);
    return Rank(t[u].ls, x);
}
int kth(int u, int k)
{
    if (k == t[t[u].ls].size + 1)
        return t[u].key;
    if (k > t[t[u].ls].size + 1)
        return kth(t[u].rs, k - t[t[u].ls].size - 1);
    if (k <= t[t[u].ls].size)
        return kth(t[u].ls, k);
    return 0;
}
int Precursor(int u, int x)
{
    if (u == 0)
        return 0;
    if (t[u].key >= x)
        return Precursor(t[u].ls, x);
    int tmp = Precursor(t[u].rs, x);
    if (tmp == 0)
        return t[u].key;
    return tmp;
}
int Successor(int u, int x)
{
    if (u == 0)
        return 0;
    if (t[u].key <= x)
        return Successor(t[u].rs, x);
    int tmp = Successor(t[u].ls, x);
    if (tmp == 0)
        return t[u].key;
    return tmp;
}
int main()
{
    srand(time(NULL));
    int root = 0;
    int n;
    cin >> n;
    while (n--)
    {
        int opt, x;
        cin >> opt >> x;
        switch (opt)
        {
        case 1:
            Insert(root, x);
            break;
        case 2:
            Del(root, x);
            break;
        case 3:
            printf("%d\n", Rank(root, x) + 1);
            break;
        case 4:
            printf("%d\n", kth(root, x));
            break;
        case 5:
            printf("%d\n", Precursor(root, x));
            break;
        case 6:
            printf("%d\n", Successor(root, x));
            break;
        }
    }
    return 0;
}