#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

const int nmax=200005;

int v[nmax];

struct cmp
{
    bool operator() (const int &x, const int &y)
    {
        return x>y;
    }
};

priority_queue <int, vector<int> , cmp> heap,secondary;

int main()
{
    freopen("heapuri.in","r",stdin);
    freopen("heapuri.out","w",stdout);
    int n,i,op,x,cnt=0;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&op);
        if(op!=3)
        {
            scanf("%d",&x);
            if(op==2)
                secondary.push(v[x]);
            else
            {
                v[++cnt]=x;
                heap.push(x);
            }
        }
        else
        {
            while(!(secondary.empty()) && secondary.top()==heap.top())
            {
                secondary.pop();
                heap.pop();
            }
            printf("%d\n",heap.top());
        }
    }
}