#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#define NMAX 100005
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
int n,m,intrat[200005],c;
multiset <int> heap;
int main()
{
    int t,a;
    fin >> n;
    intrat[c++]=0;
    for(int i=0;i<n;++i)
    {
        fin >> t;
        if(t==1)
        {
            fin >> a;
            intrat[c++]=a;
            heap.insert(a);
        }
        else if(t==2)
        {
            fin >> a;
            heap.erase(heap.find(intrat[a]));
        }
        else
        {
            multiset <int> :: iterator it = heap.begin();
            fout << *it << '\n';
        }
    }
    return 0;
}