#include<bits/stdc++.h>
#define M 5000005
typedef long long ll;
using namespace std;
bool f2;
char IO;
int rd(){
    int num=0;bool f=0;
    while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
    do num=(num<<1)+(num<<3)+(IO^48);
    while(IO=getchar(),IO>=48&&IO<=57);
    return f?-num:num;
}
int n,L[M],R[M];
bool done[M];
bool f1;
int main(){
//    cout<<1.0*(&f1-&f2)/1024.0/1024.0<<endl;
    n=rd();
    for(int i=1;i<=n;++i)
        L[i]=i-1,R[i]=i+1;
    R[0]=1;L[n+1]=n;
    for(int i=1,tp,x;i<=n;++i){
        tp=rd(),x=rd();
        if(tp==1){
            if(!done[x]){
                done[x]=1;
                L[R[x]]=L[x];
                R[L[x]]=R[x];
            }
        }else{
            if(!done[x]){
                if(x==R[0]){
                    printf("%d\n",R[x]);
                }else{
                    printf("%d\n",R[0]);
                }
            }else printf("%d\n",R[0]);
        }
    }
    return 0;
}