#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

using i64 = long long;
#define endl '\n'
#define xx first
#define yy second

signed main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> Tree;
    int q;
    cin >> q;
    int id = 0;
    while (q--)
    {
        int opt, x;
        cin >> opt >> x;
        if (opt == 1)
            Tree.insert({x, ++id});
        else if (opt == 2)
            Tree.erase(Tree.lower_bound({x, 0}));
        else if (opt == 3)
            cout << Tree.order_of_key({x, 0}) + 1 << endl;
        else if (opt == 4)
            cout << (*Tree.find_by_order(x - 1)).xx << endl;
        else if (opt == 5)
            cout << (*--Tree.lower_bound({x, 0})).xx << endl;
        else if (opt == 6)
            cout << (*Tree.upper_bound({x, numeric_limits<int>::max()})).xx << endl;
    }

    return 0;
}