#include <fstream>
#include <queue>

using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
priority_queue < pair<int,int>, vector<pair<int, int>>, greater<pair<int,int>> > h;
int n, cnt, x, used[200050], c;

int main()
{
f>>n;
    for ( int i=1; i<=n; i++ )
    {f>>c;
        if (c==1)
        {
            f>>x;
            cnt++;
            h.push ({x, cnt});
        }
        else if (c==2)
        {
           f>>x;
            used[x]=1;
        }
        else if (c==3)
        {
            while (!h.empty() && used[h.top().second])
                h.pop();
g<<h.top().first<<'\n';
        }
    }

    return 0;
}