#include<bits/stdc++.h>
using namespace std;

#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a,b) for(int i=hd[a];i;i=nxt[i])

typedef long long ll;
void Max(int &x,int y){x<y&&(x=y);}
void Min(int &x,int y){x>y&&(x=y);}

bool vio;
char IO;
int rd(int res=0){
    bool f=0;
    while(IO=getchar(),IO<48||IO>57)
        f|=IO=='-';
    do res=(res<<1)+(res<<3)+(IO^48);
    while(IO=getchar(),isdigit(IO));
    return f?-res:res;
}
const int M=5e6+10;
int sz[M],F[M];
int getfa(int x){
    return F[x]==x?x:F[x]=getfa(F[x]);
}
void Merge(int a,int b){
    a=getfa(a),b=getfa(b);
    if(a==b)return ;
    F[a]=b,sz[b]+=sz[a];
}
bool let;
int main(){
    //cerr<<(&vio-&let)/1024.0/1024<<endl;
    int n=rd();
    rep(i,1,n){
        int op=rd(),x=rd();
        if(op==1){
            if(F[x])continue;
            F[x]=x,sz[x]=1;
            if(F[x-1])Merge(x-1,x);
            if(F[x+1])Merge(x+1,x);
        }
        else {
            if(x!=1){
                if(getfa(1)==getfa(x-1)&&F[1]){
                    if(F[x])printf("%d\n",sz[getfa(1)]+1);
                    else printf("%d\n",sz[getfa(1)]+sz[getfa(x+1)]+2);
                }else printf("%d\n",sz[getfa(1)]+1);
            }else {
                if(F[x])printf("%d\n",sz[getfa(1)]+1);
                else printf("%d\n",2+sz[getfa(2)]);
            }
        }
    }    
}