#include <set>
#include <fstream>

using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");

int N, x, op, idx, i;
set<int> heap;
int v[200001];
int main() 
{

    f >> N;

    for (i = 0; i < N; ++i) 
    {
        f >> op;
        if (op == 1) 
        {
            f >> x;
            heap.insert(x);
            v[++idx] = x;
        }
        else if (op == 2) 
        {
            f >> x;
            heap.erase(v[x]);
        }
        else {
            g << *heap.begin() << endl;
        }
    }
    return 0;

}