#include <bits/stdc++.h>

using namespace std;

const int maxn=5e6; 

int n,fa[maxn+5],a[maxn+5]; 
inline int read()
{
  int x=0;char c=getchar();
  while (c<'0'||c>'9') c=getchar();
  while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
  return x;
}
int find(int x) {
  return fa[x]==x?fa[x]:fa[x]=find(fa[x]); 
}
int main() {
  n=read(); 
  for (int i=1;i<=n+1;i++) {
    fa[i]=i; 
  }
  for (int i=1;i<=n;i++) {
    int o,x;
    o=read(),x=read();
    if (o==1) {
      if (a[x]==1) continue  ; 
      fa[x]=find(x+1); 
    }
    else {
      int t=find(1);
      if (t<x) {
        printf("%d\n",t); 
        continue ; 
      }
      printf("%d\n",find(x+1)); 
    }
  }
  return 0; 
}