#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;
const int Max = 1e6 + 7, Inf = 1e9 + 7;
void print(bool x) { cout << (x ? "YES" : "NO") << endl; }
string tostring (__int128 x)
{
string ans = "";
while(x > 0)
{
ans += (x % 10 + '0');
x /= 10;
}
reverse(all(ans));
return ans;
}
void solve()
{
int n; cin >> n;
vector <pair<int, int>> v(n);
priority_queue <pair<int, int>> pq;
for(auto& u : v) cin >> u.fs >> u.sd;
sort(all(v));
for(int i = 0; i < n; i++)
pq.push({ v[i].sd, i });
map <int, int> mp; int ans = 0;
while (!pq.empty())
{
int x = pq.top().sd; pq.pop();
if(mp[x]) continue;
mp[x] = 1; ans ++;
for(int i = x+1; i < n; i++)
{
if(mp[i]) break;
if(abs(v[x].fs - v[i].fs) > v[x].sd - v[i].sd) break;
mp[i] = 1;
}
for(int i = x-1; i >= 0; i--)
{
if(mp[i]) break;
if(abs(v[x].fs - v[i].fs) > v[x].sd - v[i].sd) break;
mp[i] = 1;
}
}
cout << ans << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int Q = 1; //cin >> Q;
while (Q--)
{
solve();
}
return 0;
}
