#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
#define NMAX 100001
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
vector<int> v;
multiset<int>s;
int main() {
    int n ,t , x;
    f>>n;
    while(n--)
    {
        f>>t;
        if(t==1)
        {
            f>>x;
            v.push_back(x);
            s.insert(x);
        }else if(t==2)
        {
            f>>x;
            s.erase(s.find(v[x-1]));
        }
        else g<<*s.begin()<<'\n';
    }
    return 0;
}