#include <bits/stdc++.h>

using namespace std;

set <int> heap;
int ord[200000];

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

    int n, operation, c = 0, number;

    fin >> n;

    for (int i = 0; i < n; i++){
        fin >> operation;

    if (operation == 3)
        fout << *(heap.begin()) << "\n";

    else{
        fin >> number;
        if (operation == 1){
            heap.insert(number);
            ord[++c] = number;
        }
        else
            heap.erase(ord[number]);
    }}

    fin.close();
    fout.close();
    return 0;
}