#include <bits/stdc++.h>
using namespace std;
struct Fenwick
{
int n;
vector<int> bit;
Fenwick(int n) : n(n), bit(n+1,0) {}
void update(int i, int val)
{
for(i++; i<=n; i+=i & -i)
{
bit[i]=max(bit[i],val);
}
}
int query(int i)
{
if(i<0)
{
return 0;
}
int res=0;
i=min(i,n-1);
for(i++; i>0; i-=i & -i)
{
res=max(res,bit[i]);
}
return res;
}
};
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<pair<int,int>> constraints(n);
for(int i=0; i<n; i++)
{
cin>>constraints[i].first>>constraints[i].second;
}
vector<int> dp(n);
vector<vector<int>> available(n);
Fenwick ft(n);
int overall=0;
for(int i=0; i<n; i++)
{
if(i>0)
{
for(int prev : available[i-1])
{
ft.update(prev,dp[prev]);
}
}
int limit=i-constraints[i].first-1;
if(limit<0)
{
dp[i]=1;
}
else
{
dp[i]=1+ft.query(limit);
}
long long relase=(long long)i+constraints[i].second;
if(relase<(long long)n-1)
{
available[relase].push_back(i);
}
overall=max(overall,dp[i]);
}
cout<<overall<<endl;
return 0;
}
