#include<bits/stdc++.h>
using namespace std;
int tle;
int pan;
int op;
int n;
set<int> a;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
        pan=0;
		cin>>op;
		if(op==1){
			int shu;
			cin>>shu;
			int len=a.size();
			a.insert(shu);
			if(len==a.size()){
				cout<<"Already Exist"<<endl;
			} 
		}else{
			int lenn;
			cin>>lenn;
			if(a.empty()){
				cout<<"Empty"<<endl;
				continue;
			}
			if(a.size()==1){
				for(auto it=a.begin();it!=a.end();it++){
					cout<<*it<<' '<<endl;
					a.erase(*it); 
					break;
				}
				continue;
			}
			if(a.count(lenn)==1){		
				cout<<lenn<<endl;
				a.erase(lenn);
				continue;
			}else{
				auto wa=a.lower_bound(lenn);
				auto uke=wa;
				if(uke!=a.begin()){
					uke--;
				}
				if(lenn-(*uke)>(*wa)-lenn&&wa!=a.end()){
					uke=wa;
				}
				cout<<*uke<<endl;
				a.erase(uke);
			}
		}
	}
	return 0;
}