#include <fstream>
#include <set>
#include <vector>

using namespace std;

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

set<int> happyHeap;
vector<int> pozitii(200001);
int n, opt, aux, xd = 0;

int main(){
    fin >> n;
    for (int i = 0; i < n; i++){
        fin >> opt;
        switch(opt){
            case 1:
                fin >> aux;
                xd++;
                pozitii[xd] = aux;
                happyHeap.insert(aux);
                break;
            case 2:
                fin >> aux;
                happyHeap.erase(pozitii[aux]);
                break;
            case 3:
                fout << *happyHeap.begin() << '\n';
                break;
        }
    }
}