#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;
    return rev;
}

void solve() {
    int n;
    std::cin >> n;

    std::vector<std::pair<int, int>> ps(n);
    std::vector<int> xs;
    for (auto& p : ps) {
        int x, r;
        std::cin >> x >> r;
        x *= 2, r *= 2;

        p.first = x - r + 1;
        p.second = x + r;

        xs.push_back(p.first);
        xs.push_back(p.second);
    }

    auto revx = compress(xs);
    int m = xs.size();

    std::vector<int> imos(m + 1, 0);
    for (auto& p : ps) {
        ++imos[revx[p.first]];
        --imos[revx[p.second]];
    }

    for (int i = 0; i < m; ++i) {
        imos[i + 1] += imos[i];
    }

    std::cout << *std::max_element(imos.begin(), imos.end()) << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}