#include <cstdio>
#include <bitset>
#include <queue>
#include <vector>
#include <functional>
#include <unordered_map>
using namespace std;

int main()
{
  FILE *in, *out;

  in  = fopen ("heapuri.in",  "r");
  out = fopen ("heapuri.out", "w");

  int n; fscanf (in, "%d", &n);

  priority_queue<int, vector<int>, greater<int> > PQ;
  unordered_map<int, int> inserat_element; 
  bitset<200001> deletat;

  int cnt = 0;
  for (int i = 1; i <= n; ++i)
    {
      int tip_operatie; fscanf (in, "%d", &tip_operatie);

      int x;
      switch (tip_operatie)
	{
	case 1:
	  fscanf (in, "%d", &x); ++cnt;
	  
	  PQ.push(x);
	  inserat_element[cnt] = x;

	  break;
	
	case 2:
	  fscanf (in, "%d", &x);
	  
	  deletat[inserat_element[x]] = true;

	  break;

	case 3:
	  for (int j = PQ.top(); deletat[j] == true && PQ.size() > 0; j = PQ.top())
	    PQ.pop();
	  
	  fprintf (out, "%d\n", PQ.top());

	  break;
	default:
	  throw new exception();
	} 
    }

  return 0;
}