import sys

def input(): return sys.stdin.readline().strip()

def mapint(): return list(map(int, input().split()))

sys.setrecursionlimit(10**9)



N = int(eval(input()))

es = []

for _ in range(N):

    x, l = mapint()

    es.append((x+l, x-l))



es.sort()

now = -10**18

idx = 0

ans = 0

while 1:

    if idx==N:

        break

    end, start = es[idx]

    if start>=now:

        now = end

        ans += 1

    idx += 1



print(ans)
import sys

def input(): return sys.stdin.readline().strip()

def mapint(): return list(map(int, input().split()))

sys.setrecursionlimit(10**9)



N = int(eval(input()))



from heapq import heappush, heappop

Q = []

for _ in range(N):

    x, l = mapint()

    heappush(Q, (x+l, x-l))



ans = 0

now = -10**20

while Q:

    r, l = heappop(Q)

    if l<now:

        continue

    ans += 1

    now = r



print(ans)
import sys


def input():
    return sys.stdin.readline().strip()


def mapint():
    return list(map(int, input().split()))


sys.setrecursionlimit(10**9)
N = int(eval(input()))
es = []
for _ in range(N):
    x, l = mapint()
    es.append((x + l, x - l))
es.sort()
now = -(10**18)
idx = 0
ans = 0
while 1:
    if idx == N:
        break
    end, start = es[idx]
    if start >= now:
        now = end
        ans += 1
    idx += 1
print(ans)

import sys


def input():
    return sys.stdin.readline().strip()


def mapint():
    return list(map(int, input().split()))


sys.setrecursionlimit(10**9)
N = int(eval(input()))
from heapq import heappush, heappop

Q = []
for _ in range(N):
    x, l = mapint()
    heappush(Q, (x + l, x - l))
ans = 0
now = -(10**20)
while Q:
    r, l = heappop(Q)
    if l < now:
        continue
    ans += 1
    now = r
print(ans)

-es = [] +from heapq import heappush, heappop + +Q = [] -    es.append((x + l, x - l)) -es.sort() -now = -(10**18) -idx = 0 +    heappush(Q, (x + l, x - l)) -while 1: -    if idx == N: -        break -    end, start = es[idx] -    if start >= now: -        now = end -        ans += 1 -    idx += 1 +now = -(10**20) +while Q: +    r, l = heappop(Q) +    if l < now: +        continue +    ans += 1 +    now = r