import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
xr = LLI(n)
st = set()
lr = []
for x, r in xr:
    x, r = x*3, r*3
    l = x-r+1
    r = x+r
    st.add(l)
    st.add(r)
    lr.append((l, r))
enc = {a: i for i, a in enumerate(sorted(st))}
imos = [0]*(len(enc)+5)
for l, r in lr:
    l=enc[l]
    r=enc[r]
    imos[l] += 1
    imos[r] -= 1

for i in range(len(enc)):
    imos[i+1] += imos[i]

ans = max(imos)
print(ans)