#include<iostream>
#include<unordered_map>
using namespace std;
int n,num;
unordered_map<int,bool> mp;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int op,len;
		cin>>op>>len;
		if(op==1){
			if(mp[len]) cout<<"Already Exist"<<endl;
			else mp[len]=1,num++;
		}
		if(op==2){
			if(num==0) cout<<"Empty"<<endl;
			else{
				for(int i=0;;i++){
					if(mp[len-i]){
						cout<<len-i<<endl;
						mp[len-i]=0;
						num--;
						break;
					}
					if(mp[len+i]){
						mp[len+i]=0;
						num--;
						cout<<len+i<<endl;
						break;
					}
				}
			}
		}
	}
}