#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <iomanip>
#include <vector>
#include <bitset>

#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front

using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
typedef long long ll;
const ll Nmax=2e5+5, inf=1e9+5;
using pii=pair<int, int>;

int n;
multiset<int> st;
int v[Nmax];
int main()
{
    fin>>n;
    int crt=1, nr;
    char ch;
    for (int i=0; i<n; i++){
        fin>>ch;
        if (ch=='3')
            fout<<*st.begin()<<'\n';
        else{
            fin>>nr;
            if (ch=='1'){
                st.insert(nr);
                v[crt++]=nr;
            }
            else{
                auto it=st.lower_bound(v[nr]);
                st.erase(it);
            }
        }
    }
    return 0;
}