#include <bits/stdc++.h>

using namespace std;

int n, o, x, f[5000001];

int gf(int x) { return f[x] == x ? x : f[x] = gf(f[x]); }

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) f[i] = i;
  while (n--) {
    scanf("%d%d", &o, &x);
    if (o == 1) {
      if (f[x] == x) f[x] = x + 1;
    } else {
      int tmp = gf(1);
      if (tmp >= x)
        printf("%d\n", gf(x + 1)); else
        printf("%d\n", tmp);
    }
  }
  return 0;
}