#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define sc(x) scanf("%d",&(x));
#define pb push_back
#define fi first
#define se second

#define maxn  5000000
int A[maxn + 50];


int t;
int find(int x){
    return A[x] = (A[x] == x ? x : find(A[x]));
}
signed main(){
    //sc(t)
    t = 1;
    int op, x;
    int n;
    while(t--){
        sc(n)
        for(int i = 1; i <= n+2; i++){
            A[i] = i;
        }
        for(int i =1; i <= n; i++){
            sc(op)sc(x)
            if(op == 1){
               A[x] = find(x+1);
            }else if(op == 2){
                int y = find(1);
                //cout <<"y" << y << '\n';
                if( y == x){
                    y += find(y+1)-y;
                }
                cout << y << '\n';
            }
        }
    }
}