#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
#define ll long long
#define in(a) a=read()
#define out(a) printf("%d\n",a)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define clr(a,x) memset(a,x,sizeof(a))
inline ll read(){
    char c=getchar();ll f=1,x=0;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();
    return x*f;
}
#define mod 1000000007
void MOD(int &x){x-=x>=mod?mod:0;}
#define maxn 5000010
#define inf (1<<30)

int fa[maxn];
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main(){
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    int n;
    in(n);
    FOR(i,1,n+1)fa[i]=i;
    FOR(i,1,n){
        int c,x;
        in(c);in(x);
        if(c==1)fa[x]=find(fa[x+1]);
        else{
            int pos=find(1);
            if(pos==x)pos=find(x+1);
            out(pos);
        }
    }
}