#include <bits/stdc++.h>

using namespace std;

set<int> s;
int n, t, x;
vector<int> v;
set<int>::iterator it;

int main()
{
    cin >> n;
    for (int i=0; i<n; i++)
    {
        cin >> t;
        switch(t)
        {
        case 1:
            cin >> x;
            s.insert(x);
            v.push_back(x);
            break;
        case 2:
            cin >> x;
            it = s.find(v[x-1]);
            s.erase(it);
            break;
         case 3:
            cout << *s.begin()<< '\n';
            break;
        default:
            break;
        }
    }
    return 0;
}