#include <iostream>
#include <set>
#include <fstream>
using namespace std;
int v[200005];
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
set<int>pq;
int main()
{
    int n, del=0;
    fin>>n;
    for (int i=1; i<=n; i++) {
        int op, x;
        fin>>op;
        if (op==1) {
            fin>>v[i];
            v[i]*=-1;
            pq.insert(v[i]);
        }
        if (op==2) {
            fin>>x;
            int elm=v[x+del];
            cout<<x<<" "<<elm<<endl;
            pq.erase(pq.find(elm));
            v[x]=-2000000000;
            del++;
        }
        if (op==3) {
            fout<<-*pq.rbegin()<<'\n';
        }
    }
    return 0;
}