import sys
n =int(input())if n ==1:print(1)
sys.exit(0)elif n ==2:print(2)
sys.exit(0)
tree =[list(map(int,input().split()))for _ inrange(n)]
tree.sort()
ans =2for i inrange(1, n -1):if tree[i][0]- tree[i][1]> tree[i -1][0]:
ans +=1elif tree[i][0]+ tree[i][1]< tree[i +1][0]:
ans +=1
tree[i][0]+= tree[i][1]print(ans)