#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");

set<int> pq;
vector<int> v;
int n,i,operatie,x,nr=0;
int main ()
{
    in>>n;
    v.assign(200001,0);
    for(i=0; i<n; i++)
    {
        in>>operatie;
        switch(operatie)
        {
        case 1:
            in>>x;
            pq.insert(x);
            v[++nr]=x;
            break;
        case 2:
            in>>x;
            pq.erase(v[x]);
            break;
        case 3:
            out<<*pq.begin()<<'\n';
            break;
        }
    }
    return 0;
}