#include <fstream>
#include <vector>
#include <set>
using namespace std;

ifstream f ("heapuri.in");
ofstream g ("heapuri.out");

vector <int> pozitie;
multiset <int> heap;

int n, x, y;

int main(){
    f >> n;
    pozitie.reserve(n+1);
    pozitie.push_back(0);

    for(int i = 1; i <= n; ++i){
        f >> x;
        if(x == 1){
            f >> y;
            pozitie.push_back(y);
            heap.insert(y);
        }
        if(x == 2){
        f >> y;
            heap.erase( heap.find(pozitie[y]) );
        }
        if(x == 3) g << *heap.begin() << "\n";
    }
    f.close();
    g.close();

    return 0;
}