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

using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");

multiset<int> a;
vector<int> b;


int main()
{
    int n;
    in >> n;
    b.push_back(0);
    for (int i = 0; i < n; ++i)
    {
        int x,y; in >> x;
        if ( x == 1 ) { in >> y; b.push_back(y); a.insert(y); }
        if ( x == 2 ) { in >> y; a.erase( a.find(b[y]) ); }
        if ( x == 3 ) { out << *(a.begin()) << '\n'; }
    }
    return 0;
}