#include<bits/stdc++.h>
#define int long long
using namespace std;

vector < int > q;

int T;

int a , b;

int num;

inline int Abs(int m)
{
	return m >= 0 ? m : -m;
}

main()
{
	cin >> T;
	
	while(T --)
	{
		cin >> a >> b;
		
		if(a == 1)
		{
			if(binary_search(q.begin() , q.end() , b))
			printf("Already Exist\n");
			
			else
			q.insert(upper_bound(q.begin() , q.end() , b) , b);
		}
		
		else
		{
			if(q.empty())
			{
				printf("Empty\n");
				continue;
			}
			
			num = lower_bound(q.begin() , q.begin() + q.size() , b) - q.begin();
			
			if(q[num] == b)
			cout << b << '\n' , q.erase(q.begin() + num);
			else if(num)
			{
				if(Abs(q[num - 1] - b) <= Abs(q[num]) - b)
				cout << q[num - 1] << '\n' , q.erase(q.begin() + num - 1);
				else
				cout << q[num] << '\n' , q.erase(q.begin() + num);
			}
			else
			cout << q[0] << '\n' , q.erase(q.begin());
		}
	}
}