#include <bits/stdc++.h>
using namespace std;
 
#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=1e9+7,maxn=5e6+10;
int T,n,m,k,x,y,fa[maxn],a[maxn];
int get_fa(int x) {
    return ((x == fa[x]) ? x : (fa[x] = get_fa(fa[x])));
}
void uni(int x, int y) {
    if (x > y) swap(x, y);
    x = get_fa(x);
    y = get_fa(y);
    fa[x] = y;
}
int main(int argc, char const *argv[]) {
    scanf("%d", &n);
    for (int i=1;i<=n;++i) {
        fa[i] = i;
    }
    int nn=n;
    while (nn--) {
        scanf("%d %d", &x, &y);
        if (x == 1) {
            if (!a[y] and a[y-1] == 1) {
                uni(y-1, y);
            }
            if (!a[y] and a[y+1] == 1) {
                uni(y, y+1);
            }
            a[y] = 1;
        }
        else {
            if (!a[1]) {
                if (y > 1) printf("1\n");
                else {
                    if (a[y+1]) printf("%d\n", get_fa(y+1)+1);
                    else printf("%d\n", y+1);
                }
                continue;
            }
            if (get_fa(1) == y-1) {
                if (a[y+1]) printf("%d\n", get_fa(y+1)+1);
                else printf("%d\n", y+1);
            }
            else {
                printf("%d\n", get_fa(1)+1);
            }
        }
    }
    return 0;
}
 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
clock_t clk;
clk = clock();
if(clock() - clk > CLOCKS_PER_SEC * 0.9) 
      T
W     L
A C M E R
  E L   E
    E
*/