/* -*- coding: utf-8 -*-
 *
 * 1137.cc:  No.1137 Circles - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int R = 200000 * 2;
const int M = R * 2 + 1;

/* typedef */

/* global variables */

int cs[M];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    int xi, ri;
    scanf("%d%d", &xi, &ri);
    xi *= 2, ri *= 2;
    cs[R + xi - ri + 1]++, cs[R + xi + ri]--;
  }

  int maxc = cs[0];
  for (int i = 1; i < M; i++) {
    cs[i] += cs[i - 1];
    if (maxc < cs[i]) maxc = cs[i];
  }

  printf("%d\n", maxc);


  return 0;
}