#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

vector<int> q;
int t;

int main()
{
    cin >> t;
    while (t --)
    {
        int op,x;
        scanf("%d%d",&op,&x);
        if (op == 1)
        {
            bool b = 0;
            for(int i = 0;i < q.size();i ++)
                if (q[i] == x)
                {
                    printf("Already Exist\n");
                    b = 1;
                    break;
                }
            if (!b) q.push_back(x);
        }
        else
        {
            if (q.size() == 0) printf("Empty\n");
            else
            {
                int c = 2e9,pos,len;
                for(int i = 0;i < q.size();i ++)
                {
                    int cha = abs(q[i] - x);
                    if (cha < c)
                        c = cha,pos = i,len = q[i];
                    if (cha == c && x < q[i]) pos = i,len = q[i];
                }
                printf("%d\n",len);
                q.erase(q.begin() + pos);
            }
        }
    }
    return 0;
}