#include <fstream>
#include <set>
#include <vector>
using namespace std;

int n;
multiset<int> Hash;
vector<int> v;

int main() {
    int i, op, x;

    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    f >> n;
    for (i = 1; i <= n; i++) {
        f >> op;
        if (op == 1) {
            f >> x;
            Hash.insert(x);
            v.push_back(x);
        }
        else if (op == 2) {
            f >> x;
            Hash.erase(Hash.find(v[x - 1]));
        }
        else 
            g << *Hash.begin() << '\n';
    }
    f.close();
    g.close();
    return 0;
}