//#include #include #include #include #include #include #include #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower using namespace std; //using namespace atcoder; using ll = long long; #define all(A) A.begin(),A.end() using vll = vector; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) using Graph = vector>>; ll N,B,K; ll mod=1e9+7; vll C; char tr(char C){ if(C>'a'){ return (C-'a'+'A'); } else{ return (C-'A'+'a'); } } int main(){ ll N; cin>>N; vll X(2*1e6,0); rep(i,N){ ll x,R; cin>>x>>R; X[x-R+1+ll(1e6)]++; X[x+R+ll(1e6)]--; } ll k=0; ll an=0; rep(i,2e6){ k+=X[i]; an=max(an,k); } cout<