#include <bits/stdc++.h> using namespace std; priority_queue<int,vector<int>,greater<int>> q; int main(){ long n; cin>>n; while(n--){ int op,x; cin>>op; if(op==1){ cin>>x; q.push(x); } if(op==2)cout<<q.top(); else q.pop(); } return 0; }