#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<pair<int, int>> v(2*n);
    for (int i = 0; i < n; ++i) {
        int x, r;
        scanf("%d %d", &x, &r);
        v[i] = {2*(x-r)+1, 1};
        v[i+n] = {2*(x+r), -1};
    }
    sort(v.begin(),v.end());
    int ans = 0, cur = 0;
    for (int i = 0; i < 2*n; ++i) {
        cur += v[i].second;
        ans = max(ans, cur);
    }
    cout << ans << "\n";
    return 0;
}