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

const int maxn = 5005005;
int v[maxn], pa[maxn], mx[maxn];

int fnd(int u) { return u == pa[u] ? u : (pa[u] = fnd(pa[u])); }
void mrg(int u, int v) {
    u = fnd(u), v = fnd(v);
    pa[u] = v;
    mx[v] = max(mx[u], mx[v]);
}

int main(void) {
    int n; scanf("%d", &n);
    for (int i=0; i<=n; i++) pa[i] = mx[i] = i;
    v[0] = 1;
    for (int i=0; i<n; i++) {
        int op, x; scanf("%d%d", &op, &x);
        if (op == 1) {
            v[x] = 1;
            if (v[x - 1]) mrg(x, x - 1);
            if (v[x + 1]) mrg(x, x + 1);
        } else {
            int u = fnd(0);
            if (mx[u] + 1 != x) printf("%d\n", mx[u] + 1);
            else if (!v[x + 1]) printf("%d\n", x + 1);
            else {
                int v = fnd(x + 1);
                printf("%d\n", mx[v] + 1);
            }
        }
    }
    return 0;
}