#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "heapuri.in";
const char outfile[] = "heapuri.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

priority_queue <pair<int, int>, vector <pair<int, int> > , greater <pair<int, int> > > Heap;
int N, K;
bitset <MAXN> erased;

int main() {
    fin >> N;
    for(int i = 1 ; i <= N ; ++ i) {
        int query, x;
        fin >> query;
        switch(query) {
        case 1:
            fin >> x;
            Heap.push(make_pair(x, ++ K));
            break;
        case 2:
            fin >> x;
            erased[x] = true;
            break;
        case 3:
            while(erased[Heap.top().second])
                Heap.pop();
            fout << Heap.top().first << '\n';
            break;
        }
    }
    fin.close();
    fout.close();
    return 0;
}