#include <iostream>
#include <fstream>
#include <set>
#define MAX 200002
using namespace std;
int n,v[MAX],k,x,t;
multiset<int> s;

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

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> t;
        if(t == 1){
            fin >> x;
            s.insert(x);
            v[++k] = x;
        }else if(t == 2){
            fin >> x;
            s.erase(v[x]);
        }else{
            fout << *s.begin() << "\n";
        }
    }
    return 0;
}