#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e6+5;
const int mod=1e9+7;
#define ll long long
#define IOS ios::sync_with_stdio(false),cin.tie(0)
inline int read(){
    char ch = getchar();int x = 0, f = 1;
    while(ch<'0'||ch>'9'){if(ch == '-') f = -1;ch = getchar();}
    while('0'<=ch && ch <= '9'){x = x*10+ch-'0';ch = getchar();}
    return x*f;
}

inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
int s[maxn][3];

int main(){
    IOS;
    int n;
    n=read();
    //cout<<s.max_size() ;
    s[0][2]=1;
    for(int i=1;i<=n;++i){
        s[i][0]=i;
        s[i][1]=i-1;
        s[i][2]=i+1;
    }
    int m=n;
    int cnt=n;
    while(m--){
        int f,x;
        f=read();
        x=read();
        if(f==1){
            //s.erase(x);
            if(s[x][0]){
                cnt--;
                s[x][0]=0;
                s[s[x][1]][2]=s[x][2];
                s[s[x][2]][1]=s[x][1];
            }
        }
        else{
            if(cnt==0)
                cout<<n+1<<"\n";
            else{
                int a=s[0][2];
                if(a!=x){
                    cout<<a<<"\n";
                }
                else{
                    if(cnt==1)
                        cout<<n+1<<'\n';
                    else{
                        a=s[s[0][2]][2];
                        cout<<a<<"\n";
                    }
                }
            }
                
            
        }
    }
    return 0;
}