#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.count(lenn)==1){		
				cout<<lenn<<endl;
				a.erase(lenn);
				continue;
			}else{
				for(auto it:a){
					if((it)>lenn&&tle<lenn){
						if(lenn-tle<=it-lenn){
							cout<<tle<<endl;
							a.erase(tle);
							break;
						}else{
							cout<<it<<endl;
							a.erase(it);
							break;
						}
					}
					tle=it;
				}
			}
		}
	}
	return 0;
}