#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1e6+10,bs=701;
int A[N],D[N],E[N],n,m,k,q,pre[N],pos[N],lz[N*4],val[N],L[N],R[N],nn;
vector<int>dp[N],vecc,tmp;
set<int> C;
pii Q[N],seg[N*4];
void shift(int l,int r,int v){
if(r-l==1 || lz[v]==0)return;
int mid=(l+r)>>1;
seg[v<<1].F+=lz[v];
seg[v<<1|1].F+=lz[v];
lz[v<<1]+=lz[v];
lz[v<<1|1]+=lz[v];
lz[v]=0;
}
void build(int l=1,int r=n+1,int v=1){
if(r-l==1){
seg[v]={Q[l].F,-l};
return;
}
int mid=(l+r)>>1;
build(l,mid,v<<1);
build(mid,r,v<<1|1);
seg[v]=min(seg[v<<1],seg[v<<1|1]);
}
void upd(int lx,int rx,int x,int l=1,int r=n+1,int v=1){
shift(l,r,v);
if(lx>=r || rx<=l)return;
if(lx<=l && r<=rx){
seg[v].F+=x;
seg[v].F=min(seg[v].F,N);
lz[v]+=x;
return;
}
int mid=(l+r)>>1;
upd(lx,rx,x,l,mid,v<<1);
upd(lx,rx,x,mid,r,v<<1|1);
seg[v]=min(seg[v<<1],seg[v<<1|1]);
}
int main(){
fast_io
vecc.pb(-1);
cin>>n;
for1(n){
int p,x;cin>>p>>x;
vecc.pb(x);
Q[i]={p,x};
}
sort(all(vecc));vecc.resize(unique(all(vecc))-vecc.begin());
for0(n+2)for(int j=0;j<vecc.size();j++)dp[i].pb(0);
build();
for1(n){
int j=-seg[1].S;
pos[j]=i;
upd(1,j,1);
upd(j,j+1,N);
}
C.insert(0);nn=0;
for1(n){
int p=pos[i],v=Q[i].S;
v=lb(all(vecc),v)-vecc.begin();
val[p]=v;
C.insert(p);
nn=max(nn,p);
auto x=C.find(p);x--;
dp[p]=dp[(*x)];
while(1){
x=C.find(p);x--;
int t=dp[(*x)][val[p]-1]+1;
vector<int> tmp2;
for(int y:tmp){
if(dp[p][y]<dp[(*x)][y])
tmp2.pb(y);
dp[p][y]=max(dp[p][y],dp[(*x)][y]);
}
for(int y=val[p];y<vecc.size();y++){
if(dp[p][y]>=t)break;
tmp2.pb(y);
dp[p][y]=max(dp[p][y],t);
}
swap(tmp,tmp2);
if(p==nn || tmp.size()==0)
break;
p=(*C.ub(p));
}
tmp.clear();
cout<<dp[nn][vecc.size()-1]<<endl;
}
}
