#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=610005,INF=15<<26;

int BI[MAX],R[MAX],RR[MAX];
pii dp[MAX];
const int D=800;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    int M=610000;
    for(int i=0;i<=M;i++){
        BI[i]=INF;
        R[i]=INF;
        RR[i]=INF;
        dp[i]=mp(0,INF);
    }
    
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    for(int i=0;i<N;i++){
        int a,b;cin>>a>>b;
        /*
         a=rng()%600000;if(a<0) a+=600000;
         a++;
         b=rng()%600000;if(b<0) b+=600000;
         b++;
         if(a>b) swap(a,b);
         */
        //cout<<a<<" "<<b<<endl;
        int aa=a/D,bb=b/D;
        if(aa==bb){
            chmin(R[a],b);
            chmin(RR[a],b);
            int mi=INF;
            for(int s=aa*D;s<aa*D+D;s++) dp[s]=mp(0,INF);
            for(int s=(aa+1)*D-1;s>=aa*D;s--){
                chmin(mi,R[s]);
                if(s!=(aa+1)*D-1) chmin(RR[s],RR[s+1]);
                if(mi!=INF){
                    if(mi==(aa+1)*D-1){
                        dp[s]=mp(1,(aa+1)*D-1);
                    }else if(dp[mi+1].fi==0){
                        dp[s]=mp(1,mi);
                    }else{
                        dp[s]=mp(dp[mi+1].fi+1,dp[mi+1].se);
                    }
                }
                
            }
            chmin(BI[aa],b);
        }else{
            chmin(RR[a],b);
            chmin(BI[aa],b);
            for(int s=(aa+1)*D-1;s>=aa*D;s--){
                if(s!=(aa+1)*D-1) chmin(RR[s],RR[s+1]);
            }
        }
        
        int ans=0,now=0,turn=0;
        while(now<=600000){
            //if(i==9898) cout<<now<<" "<<ans<<endl;
            if(dp[now].fi){
                turn++;
                ans+=dp[now].fi;
                now=dp[now].se+1;
            }else{
                int aa=now/D,tomi=INF;
                chmin(tomi,RR[now]);
                //cout<<i<<" "<<tomi<<endl;
                int po=aa+1;
                while(1){
                    //if(i%1000==0) cout<<i<<" "<<now<<" "<<po<<" "<<tomi<<endl;
                    turn++;
                    if(po*D>600000){
                        now=INF;
                        break;
                    }
                    if(po<tomi/D){
                        if(BI[po]/D==po){
                            now=po*D;
                            break;
                        }else{
                            chmin(tomi,BI[po]);
                            po++;
                        }
                    }else if(po==tomi/D){
                        ans++;
                        now=min(BI[po],tomi)+1;
                        break;
                    }else{
                        if(po*D>600000){
                            now=INF;
                            break;
                        }
                    }
                }
            }
        }
        //if(i%1000==0) cout<<i<<" "<<turn<<endl;
        cout<<ans<<"\n";
    }
}