#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");

set <int> s;

unordered_map<int,int>m;
int v[200002],k;

int main()
{
int n,p,x;
f>>n;
for (int i=1;i<=n;i++) {f>>p;
                         if (p==1) {f>>x;
                                    m[x]++;
                                    if (m[x]==1) s.insert(x);
                                    k++;
                                    v[k]=x;
                                  }
                      if (p==2) {f>>x;
                                 m[v[x]]--;
                                if (m[v[x]]==0) s.erase(v[x]);
                                }
                        if (p==3) {auto it=s.begin();
                                    g<<*it<<'\n';
                                  }

                       }
}