#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

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

multiset<int> heap;

void solve(){

    int queries; cin >> queries;
    int cnt = 0;
    unordered_map<int, int> fr;

    for(int i = 1; i <= queries; ++i){
        int type; cin >> type;
        if(type == 1){
            int number; cin >> number;
            heap.insert(number);
            fr[++cnt] = number;
        }
        else if(type == 2){
            int index; cin >> index;
            heap.erase(fr[index]);
        }
        else {
            cout << *(heap.begin()) << '\n';
        }
    }

}

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