#include <bits/stdc++.h> using namespace std; #define ll long long const int N = 1e7+2; pair<int,int> ar[N+2]; int n; vector<int>pos; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for(int i =1;i<=n;i++){ int x, y; cin >> x >> y; ar[i]= {x+y, x-y}; } sort(ar+1, ar+n+1, greater<pair<int,int>>()); vector<int> tail; for(int i=0;i<n;i++){ int val = ar[i+1].second; auto it = lower_bound(tail.begin(), tail.end(), -val); if(it==tail.end()) tail.push_back(-val); else *it = -val; } cout << int(tail.size()); return 0; }