#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[8]={-1,0,1,0};
int dy[8]={0,1,0,-1};
const int N=1+10,mod=80112002;
string s,ss;
char cz;
int  len,m,a,b,c,d,k,x,y,w[N],f[N],n,o,p,
dp[1005],dis[N],bj[1515],h[N],ne[N],e[N];
ll idx;
int res,ans,num;
vector<int>v,v1;
typedef pair<string,string> pp;
queue<pp>q;
map<int,int>mp;
void add(int a,int b,int c)
{
	w[idx]=c;
	e[idx]=b;
	ne[idx]=h[a];
	h[a]=idx++;
}
int main()
{
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	while(n--){
		cin>>a>>b;
		if(a==1){
			if(mp[b]){
				cout<<"Already Exist"<<"\n";
			}else{
				mp[b]=1;
			}
		}else{
			if(mp.empty()){
				cout<<"Empty\n";
				continue;
			}
			if(mp[b]){
				mp.erase(b);
				cout<<b<<"\n";
			}else{
				mp[b]=1;
				auto itt=mp.find(b);
				auto q1=itt,q2=itt;
				if(itt==mp.begin()){
					itt++;
					cout<<itt->first<<"\n";
					mp.erase(itt);
				}else if(itt==mp.end()){
					itt--;
					cout<<itt->first<<"\n";
					mp.erase(itt);
				}else{
					if(b-(--itt)->first>(++q1)->first-b){
						cout<<q1->first<<"\n";
						mp.erase(q1);
					}else{
						cout<<itt->first<<"\n";
						mp.erase(itt);	
					}
				}
				mp.erase(q2);
			}
		}
	}
	return 0;	
}