#include <bits/stdc++.h>
using namespace std;

int main()
{
    // https://tutoriale-pe.net/structuri-de-date-heapuri-c/
    ifstream f("heapuri.in");
    ofstream o("heapuri.out");

    int n, poz[200005], k, a, x;
    set<int> heap;
    f >> n;
    if(x == 1){
        f >> a;
        heap.insert(a);
        poz[++k] = a;
    }
    else if(x == 2)
    {
        f >> a;
        heap.erase(poz[a]);
    }
    else{
        o << *heap.begin() << '\n';
    }

    return 0;
}