#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

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

#define nmax 200005

set <int> Heap;

int n,Poz[nmax],task,x,q=0;

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>task;
        switch(task)
        {
        case 1:
            {
                fin>>x;
                Heap.insert(x);
                q++;
                Poz[q]=x;
                break;
            }
        case 2:
            {
                fin>>x;
                Heap.erase(Poz[x]);
                break;
            }
        case 3:
            {
                fout<<*Heap.begin()<<'\n';
                break;
            }
        }
    }
}