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

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

set <int> heap;
vector<int>pozitie(200001);
int n;

int main()
{
    int i, j, op, x;
    fin >> n;
    j = 1;
    for (i = 0; i < n; i++)
    {
        fin >> op;
        if (op == 1)
        {
            fin >> x;
            heap.insert(x);
            pozitie[j++] = x;

        }
        else if (op == 2)
        {
            fin >> x;
            heap.erase(pozitie[x]);
        }
        else fout << *heap.begin() <<"\n";
    }
    
    fin.close();
    fout.close();
    return 0;
}