#include<bits/stdc++.h>

using namespace std;

set<int> heap;
vector<int>v{0};

int x,n,poz,elem,i;

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

int main()
{
    in>>n;
    for(i=1; i<=n; i++)
    {
        in>>x;
        if(x==1)
        {
            in>>elem;
            v.push_back(elem);
            heap.insert(elem);
        }
        if(x==2)
        {
            in>>poz;
            heap.erase(v[poz]);
        }
        if(x==3)
        {
            out<<*heap.begin()<<"\n";
        }
    }
    return 0;
}