#include<bits/stdc++.h>
using namespace std;
int solve(int i,vector<int> &dp,vector<int> &l){
if(i==0) return dp[i]=1;
if(dp[i]!=-1) return dp[i];
//Take
int option1=0;
if(i-l[i]-1>0) option1 = 1 + solve(i-l[i]-1,dp,l);
else option1 = 1;
//NotTake
int option2=0;
if(i-1>0) option2 = solve(i-1,dp,l);
option2=0;
return dp[i] = max(option1,option2);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> l(n);
vector<int> r(n);
int ans=0;
vector<int> dp(n,-1);
for(int i=0;i<n;i++){
cin >> l[i] >> r[i];
}
for(int i=0;i<n;i++){
ans = max(ans,solve(i,dp,l));
}
cout<<ans<<"\n";
}
