#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <string>
#include <algorithm>
#include <iterator>
#include <iostream>
#include <cassert>
#include <stdio.h>
using namespace std;
multiset<int> heap;
int main()
{
    int n,i,x,op;
    freopen("heapuri.in","r",stdin);
    freopen("heapuri.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d",&op);
        if(op==1)
        {
            scanf("%d",&x);
            heap.insert(x);
        }
        if(op==2)
        {
            scanf("%d",&x);
            heap.erase(x);
        }
        if(op==3)
        {
            multiset<int> ::iterator it=heap.begin();
            printf("%d\n",*it);
        }
    }
    return 0;
}