#include<iostream>
#include<map>
using namespace std;
const int N = 1e5 + 5, maxn = 10000005;

int root = 0;

struct node{
    int l, r;
    int sum;
    int ls, rs;
}tree[N * 40];
int cnt = 0;

int New(int l, int r){
    tree[++cnt].l = l;
    tree[cnt].r = r;
    return cnt;
}

void insert(int &k, int l, int r, int x, int v){
    if(k == 0){
        k = New(l, r);
    }
    tree[k].sum += v;
    if(l == r){
        return;
    }
    int mid = (l + r) >> 1;
    if(mid >= x){
        insert(tree[k].ls, l, mid, x, v);
    }else{
        insert(tree[k].rs, mid + 1, r, x, v);
    }
}

int find_kth(int k,int x){
    int mid = (tree[k].l + tree[k].r) >> 1;
    if(tree[k].l == tree[k].r) return tree[k].l;
    if(x <= tree[tree[k].ls].sum) return find_kth(tree[k].ls, x);
    else return find_kth(tree[k].rs, x - tree[tree[k].ls].sum);
}

int find_rank(int k ,int l, int r){
    if(tree[k].l >= l && tree[k].r <= r) return tree[k].sum;
    int mid = (tree[k].l + tree[k].r) >> 1;
    int ans = 0;
    if(l <= mid) ans += find_rank(tree[k].ls, l, r);
    else ans += find_rank(tree[k].rs, l, r);
    return ans;
}

map<int, int>ma;
void solve(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        int op, x;
        cin >> op >> x;
        if(op == 1){
            insert(root, 1, maxn * 2, x + maxn, 1);
            ma[x]++;
        }else if(op == 2){
            insert(root, 1, maxn * 2, x + maxn, -1);
            ma[x]--;
        }else if(op == 3){
            cout << find_rank(root, 1, x + maxn - 1) + 1 << '\n';
        }else if(op == 4){
            cout << find_kth(root, x) - maxn << '\n';
        }else if(op == 5){
            cout << (--ma.lower_bound(x))->first << '\n';
        }else if(op == 6){
            cout << (ma.lower_bound(x))->first << '\n';
        }
        
    }
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}