#include <iostream>
#include <fstream>
#include <algorithm>
#include <unordered_map>
#include <queue>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
unordered_map<int, int> h;
int n, m, x, t, del[200002];
priority_queue<int> q;

void out(){
while(h[-q.top()]==0) q.pop();
g<<-q.top()<<'\n';
}

int main()
{
    f>>m;
    int i=0;
    while(m--)
    {
        f>>t;
        if(t==1) f>>x, q.push(-x), del[++i] = x, h[x]=1;
        if(t==2) f>>x, h[del[x]]=0;
        if(t==3) out();
    }
    return 0;
}