#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
vector<bool> v(200005,false);
typedef pair<int,int> ii;
priority_queue<ii,vector<ii>,greater<ii> > q;
int main()
{
	int n,i,tip,x,nri=0;
	in=fopen("heapuri.in","r");
	out=fopen("heapuri.out","w");
	fscanf(in,"%d",&n);
	FOR(i,1,n)
	{
		fscanf(in,"%d",&tip);
		if (tip==3)
		{
			fprintf(out,"%d\n",q.top().fs);
			continue;
		}
		fscanf(in,"%d",&x);
		if (tip==1)
		{
			nri++;
			v[nri]=1;
			q.push(mp(x,nri));
			continue ;
		}
		v[x]=0;
		while (!q.empty()&&!v[q.top().ss])
			q.pop();
	}
	fclose(in);
	fclose(out);
	return 0;
}