#include<bits/stdc++.h>
using namespace std;
#define N 5000005
#define mod 998244353
#define ll long long
int t,n,m,p,x,f[N],num[11];
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 k){
    if (k==f[k])return k;
    return f[k]=find(f[k]);
}
void write(int x){
    while (x){
        num[++num[0]]=x%10;
        x/=10;
    }
    if (!num[0])putchar('0');
    while (num[0])putchar(num[num[0]--]+'0');
}
int main(){
    t=1;
    while (t--){
        n=read();
        for(int i=1;i<=n+1;i++)f[i]=i;
        for(int i=1;i<=n;i++){
            p=read(),x=read();
            if (p==1){
                if (find(x)!=find(x+1))f[find(x)]=find(x+1);
            }
            if (p==2){
                if (find(1)<x)write(find(1));
                else write(find(x+1));
                putchar('\n');
            }
        }
    }
    return 0;
}