#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
using namespace std;


int main(){
    int n;
    vector < int > v;
    ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");
    fin >> n;
    for ( int i = 0; i < n; i++ ){
        int x;
        fin >> x;
        if( x == 1 ){
            int nr;
            fin >> nr;
            v.push_back(nr);
        }
        if( x == 2 ){
            int poz;
            fin >> poz;
            v[poz-1] = 1000000001;
        }
        if( x == 3 ){
            int minim = 1000000001;
            for ( int j = 0; j < v.size(); j++ ){
                if( v[j] < minim ) minim = v[j];
            }
            fout << minim << endl;
        }
    }
}