#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("heapuri.in");
ofstream g ("heapuri.out");
vector <long long> v, poz;
long n;
long long nr, k;
int main()
{
    f >> n;
    int op;
    for(long i = 0; i < n; i++)
    {
        f >> op;
        if(op == 1) {
            f >> nr;
            v.push_back(nr);
            sort(v.begin(), v.end());
            poz.push_back(nr);
        }
        if(op == 2)
        {
            f >> nr;
            remove(v.begin(),v.end(), poz[nr - 1]);
            sort(v.begin(), v.end());
        }
        if(op == 3)
            g << v[0]<<'\n';
    }
    return 0;
}