//
//  main.cpp
//  Heapuri
//
//  Created by Mara Dascalu on 12/04/2021.
//

#include <iostream>
#include <fstream>
#include <vector>
#include<bits/stdc++.h>

using namespace std;

ifstream input("heapuri.in");
ofstream output("heapuri.out");

vector<int> heap;
int poz[200001], n, op, ins, val;

int main(int argc, const char * argv[]) {
    input>>n;

    for (int i = 0; i < n;  i++){
        input>>op;
        if (op == 1)
        {
            input>>val;
            poz[++ins] = val;
            heap.push_back(val);
        }
        else if (op == 2)
            {
                input>>val;
                auto it = find(heap.begin(), heap.end(), poz[val]);
                heap.erase(it);
            }
        else {
                make_heap(heap.begin(), heap.end());
                output<<heap.back()<<"\n";
            }
        }
}