#pragma GCC optimize ("03", "Ofast", "unroll-loops")
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

#define INFILE "heapuri.in"
#define OUTFILE "heapuri.out"

void solve(){

    int queries; cin >> queries;
    vector<int> v;
    multiset<int> s;

    for(int i = 0; i < queries; ++i){
        
        int task; cin >> task;

        if(task == 1){
            int aux; cin >> aux;
            v.push_back(aux);
            s.insert(aux);
        }
        else if(task == 2){
            int aux; cin >> aux;
            if(s.find(v[aux - 1]) != s.end()){
                s.erase(s.find(v[aux - 1]));
            }
        }
        else {
            cout << *(s.begin()) << '\n';
        }

    }

}

int main(){
    ios_base::sync_with_stdio(false);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    cin.tie(0), cout.tie(0);
    solve();
    return 0;
}