#include<bits/stdc++.h>
using namespace std;
int m;
int a,l;
set<int> p;
int main()
{
	cin>>m;
	while(m--)
	{
		cin>>a>>l;
		if(a==1)
		{
			if(p.find(l)==p.end())	p.insert(l);
			else	cout<<"Already Exist"<<endl;
		}
		else if(p.empty())	cout<<"Empty"<<endl;
		else
		{
			auto it1=p.lower_bound(l);
			auto it2=it1;
			if(it2!=p.begin())	it2--;
			if(it2!=p.end()&&l-(*it2)>(*it1)-l)	it2=it1;
			cout<<*it2<<endl;
			p.erase(*it2);		
		}
	}
	return 0;
 }