#include<iostream>
#include<cstdio>
#include<set>
#include<algorithm>
#include<functional>
#include<cmath>
using namespace std;
set<int>list;
int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        if (a == 1)
        {
            if (list.find(b) != list.end())printf("Already Exist\n");
            else list.insert(b);
        }
        else
        {

            if (list.empty()) { printf("Empty\n"); continue; }
            set<int>::iterator i = list.lower_bound(b); //查询前驱后继
            set<int>::iterator j = i;
            if (j != list.begin()) j--;
            if (i != list.end() && b - (*j)>(*i) - b) j = i; //比较
            printf("%d\n",*j); //输出
            list.erase(j); //删除
            
        }
    }

}