#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef pair<int, int> P;
template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
out << c.first << ' ' << c.second;
return out;
}
template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
const int sz = v.size();
for (int i = 0; i < sz; i++) {
if (i) out << ' ';
out << v[i];
}
return out;
}
template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
for (T &x : v) in >> x;
return in;
}
template<typename T, typename U>
istream & operator >> (istream &in, pair<T, U> &c) {
in >> c.first;
in >> c.second;
return in;
}
template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}
const int mxn = 5e5 + 10, inf = 1e18 + 10;
void go() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i].ff >> a[i].ss;
}
sort(all(a));
a.erase(unique(all(a)), a.end());
n = a.size();
int ans1 = 0, ans2 = 0;
vector<pair<int, int>> v;
for(int i = 0; i < n; i++) {
v.eb(a[i].ff - a[i].ss, a[i].ff);
}
sort(all(v));
reverse(all(v));
int ls = -inf;
for(int i = 0; i < n; i++) {
if(v[i].ss > ls) {
ans1++;
ls = v[i].ss;
}
}
v.clear();
for(int i = 0; i < n; i++) {
v.eb(-a[i].ff - a[i].ss, a[i].ff);
}
sort(all(v), [&](pair<int, int> a, pair<int, int> b) {
if(a.ff == b.ff) return a.ss < b.ss;
else return a.ff > b.ff;
});
ls = inf;
for(int i = 0; i < n; i++) {
if(v[i].ss < ls) {
ans2++;
ls = v[i].ss;
}
}
// cout << ans1 << ' ' << ans2 << '\n';
cout << max(ans1, ans2) << '\n';
}
signed main() {
fast;
int t = 1;
// cin >> t;
while(t--) {
go();
}
return 0;
}
