#include <iostream>
#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;

multiset<int> s;
multiset<int> :: iterator it;

int main() {
    int t, op, x;
    cin >> t;
    while(t --) {
        scanf("%d%d", &op, &x);
        if(op == 1) {
            it = s.begin();
            int cnt = 1;
            while(*it != x) {
                it ++;
                cnt ++;
            }
            printf("%d\n", cnt);
        }
        else if(op == 2) {
            it = s.begin();
            while(x --)
                it ++;
            it --;
            printf("%d\n", *it);
        }
        else if(op == 3) {
            it = s.lower_bound(x);
            if(it == s.begin())
                puts("−2147483647");
            else {
                it --;
                printf("%d\n", *it);
            }
        }
        else if(op == 4) {
            it = s.upper_bound(x);
            if(it == s.end())
                puts("2147483647");
            else
                printf("%d\n", *it);
        }
        else
            s.insert(x);
    }
    return 0;
}

全TLE了，不知道为啥