#include <iostream>
#include <set>
#include <fstream>

using namespace std;

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

const int maxN = 2e5 + 5;

multiset <int> q;
int v[maxN];

signed main()
{
    int n; fin >> n;

    int m = 0;
    for(int i = 1; i <= n; ++i) {
        int op; fin >> op;

        if(op == 1) {

            fin >> v[++m];
            q.insert(v[m]);

        } else if(op == 2) {

            int poz; fin >> poz;
            q.erase(q.find(v[poz]));

        } else {
            fout << *(q.begin()) << "\n";
        }
    }

    return 0;
}