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

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

int n,cod,x;
set < int > Heap;
vector < int > V;

int main(){

        f >> n;
        V.resize(n+1);
            for(int i=1;i<=n;i++){
                f >> cod;
                    if(cod == 1){
                        f >> x;
                        V[++k] = x;
                        Heap.insert(x);
                        }
                    if(cod == 2){
                        f >> x;
                        Heap.erase(V[x]);

                    }
                    if(cod == 3)
                    g << *Heap.begin() << '\n';
            }
f.close();
g.close();
return 0;
    }