#include <bits/stdc++.h>
using namespace std;
string np = "heapuri";
ifstream f(np + ".in");
ofstream g(np + ".out");

// #define f cin
// #define g cout

int n, len, v[200003];
unordered_set<int> st;
priority_queue<int, vector<int>, greater<int>> q;

int main()
{
    f >> n;
    for (int cer, x; n; n--)
    {
        f >> cer;
        if (cer == 1)
            f >> x,
                v[++len] = x,
                st.insert(x),
                q.push(x);
        else if (cer == 2)
            f >> x,
                st.erase(v[x]);
        else
        {
            while (st.find(q.top()) == st.end())
                q.pop();
            g << q.top() << '\n';
        }
    }

    return 0;
}