#include <cstdio>
#include <algorithm>

const int MN = 5000005;

int N;
int A[MN];

int main() {
    scanf("%d", &N);
    int p1 = 1;
    int p2 = 2;
    for (int q = 1; q <= N; ++q) {
        int op, x;
        scanf("%d%d", &op, &x);
        if (op == 1) {
            A[x] = 1;
            while (A[p1]) ++p1;
            if (p1 == p2) ++p2;
            while (A[p2]) ++p2;
        } else {
            int ans = x == p1 ? p2 : p1;
            ans = std::min(ans, N);
            printf("%d\n", ans);
        }
    }
    return 0;
}