#include <bits/stdc++.h>

using namespace std;

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

multiset < int > heap;

int n , poz[10005] , k , x , cerinta;

int main()
{
    f >> n ;
    for ( int i = 1 ; i <= n ; i++)
    {
        f >> cerinta;
        if( cerinta == 1)
        {
            f >> x;
            heap . insert(x);
            poz[++k] = x;
        }
        else
            if(cerinta == 2)
        {
            f >> x;
            heap . erase(poz[x]);
        }
        else
            g << *heap . begin() << '\n';
    }
}