#include <iostream>
#include <fstream>
#include <set>
using namespace std;

ifstream f ("heapuri.in");
ofstream g ("heapuri.out");

int cnt = 0 , i , c , n , x , v[200005];

multiset <int>s;

int main()
{
   f >> n;
   for (int i = 1 ; i <= n ; i++)
   {
       f >> c;
       if (c == 1)
       {
           f >> x;
           s.insert (x);
           cnt++;
           v[cnt] = x;
       }
       else
        if (c == 2)
       {
           f >> x;
           s.erase (s.find (v[x]));
       }
       else
        g << *s.begin() << '\n';
   }
    return 0;
}