#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int hoge = 202020;
  int n;
  cin >> n;
  vector<int> x(n), r(n);
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> r[i];
    x[i] += hoge;
  }
  vector<ll> sum(n + hoge + 10);
  for (int i = 0; i < n; ++i) {
    sum[x[i] - r[i]]++;
    sum[x[i] + r[i] + 1]--;
  }
  for (int i = 1; i <= n + hoge; ++i) {
    sum[i] += sum[i - 1];
  }
  ll ans = 0;
  for (int i = 0; i <= n + hoge; ++i) {
    ans = max(ans, sum[i]);
  }
  cout << ans << endl;
  return 0;
}