#include <iostream>
using namespace std;
const int nmax=2e5;
struct node {
    int time,val;
};
node hp[nmax+3];
int timeToHp[nmax+3];
void insertHeap(int x){
    timeToHp[++timeToHp[0]]=x;
}
void removeHeap(int x){

}
int getMinHeap(){

}
int main() {
    int n,cer,x;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>cer;
        if(cer==1){
            cin>>x;
            insertHeap(x);
        } else if(cer==2){
            cin>>x;
            removeHeap(x);
        } else if(cer==3) {
            cout<<getMinHeap()<<"\n";
        }
    }
    return 0;
}