#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int main() {
    int N; cin >> N;
    vector<P> C(N);
    rep(i,N) cin >> C[i].first >> C[i].second;
    priority_queue<P,vector<P>,greater<P>> q;
    rep(i,N) {
        int a = C[i].first,b = C[i].second;
        q.emplace(a - b,1);
        q.emplace(a + b,-1);
    }
    int ans = 0,ret = 0;
    while (!q.empty()) {
        P p = q.top(); q.pop();
        if (p.second > 0) {
            ret ++;
        } else {
            ret--;
        }
        ans = max(ans,ret);
    }
    cout << ans << '\n';
    return 0;
}