#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

int v[200001], nr;

int main() {
    int n, tipOp, x;
    set<int> heap;

    fin >> n;
    for (int i = 0; i < n; ++i) {
        fin >> tipOp;
        switch (tipOp) {
        case 1: {
            
            fin >> x;
            heap.insert(x);
            nr++;
            v[nr] = x;
            break;
        }
        case 2: {
           
            fin >> x;
            heap.erase(v[x]);
            break;
        }
        case 3: {
     
            fout << *heap.begin() << "\n";
            break;
        }
        }
    }
    return 0;
}