#include <fstream>
#include <set>
#define NMAX 200005
using namespace std;

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

multiset<int> heap;
int ordine[NMAX];
int n;
int cer, el;

int main()
{
    f>>n;
    for(int i=1; i<=n; i++){
        f>>cer;
        if(cer == 1){
            f>>el;
            heap.insert(el);
            ordine[++ordine[0]] = el;
        }
        else if(cer == 2){
            f>>el; // se sterge al el-elea
            heap.erase(heap.find(ordine[el]));
        }
        else g<<*heap.begin()<<'\n';
    }
    return 0;
}