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

using namespace std;

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

multiset<int>multis;
const int NMAX=2e5+5;

int v[NMAX];

int main()
{
    int t,i,j,cer,x;
    int kon=0;
    fin>>t;
    while(t--)
    {
        fin>>cer;
        if(cer==1)
        {
            kon++;
            fin>>v[kon];
            multis.insert(v[kon]);
        }
        else if(cer==2)
        {
            fin>>x;
            multis.erase(v[x]);
        }
        else
        {
            auto it=multis.begin();
            fout<<*it<<"\n";
        }
    }
    return 0;
}