#include<iostream>
#include<cstdio>
using namespace std;
const int N = 5000001;
bool a[N];
int f[N], maxl;

inline bool read(int &num){
        char in;bool IsN=false;
        in=getchar();
        if(in==EOF) return false;
        while(in!='-'&&(in<'0'||in>'9')) in=getchar();
        if(in=='-'){ IsN=true;num=0;}
        else num=in-'0';
        while(in=getchar(),in>='0'&&in<='9'){
                num*=10,num+=in-'0';
        }
        if(IsN) num=-num;
        return true;
}

int F(int x){
    for(; x<N; x+=x&-x){
        f[x]++;
    }
}

int D(int x){
    for(; x<N; x+=x&-x){
        f[x]--;
    }
}

int G(int x){
    int r = 0;
    for(; x; x-=x&-x){
        r += f[x];
    }
    return r;
}

int main(){
    int n, opt, i, j;
    scanf("%d", &n);
    //maxl = 1;
    while(n--){
        // opt = read();
        // i = read();
        // read(opt);
        // read(i);
// cout<<' '<<opt<<' '<<i<<endl;
        scanf("%d%d",&opt, &i);
        if(opt&1){
            if(!a[i]){
                a[i] = 1;
                F(i);
                if(maxl == i-1) maxl++;
            }
        }
        else{
            if(!a[i])F(i);
            //for(j = maxl+1; j==i || a[j]; j++);
            int l = maxl, r = N-1, mid, ans = maxl+1;
// cout<<l<<' '<<r<<endl;
            while(l<r){
                mid = l+r>>1;
                if(G(mid) < mid) r = mid;
                else l = mid+1, ans = mid;
// cout<<' '<<l<<' '<<mid<<' '<<r<<' '<<G(mid)<<endl;
            }
// cout<<l<<' '<<mid<<' '<<r<<endl;
// cout<<G(l)<<' '<<G(mid)<<endl;
            //if(G(l) >= l-1)mid = l;
            printf("%d\n", ans+1);
            if(!a[i])D(i);
        }
    }
}