Problem:
Score : 200 points

Problem Statement

In a factory, there are N robots placed on a number line.
Robot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.

We want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.
Here, for each i (1 \leq i \leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.

Find the maximum number of robots that we can keep.

Constraints

1 \leq N \leq 100,000

0 \leq X_i \leq 10^9 (1 \leq i \leq N)

1 \leq L_i \leq 10^9 (1 \leq i \leq N)

If i \neq j, X_i \neq X_j.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
X_1 L_1
X_2 L_2
\vdots
X_N L_N

Output

Print the maximum number of robots that we can keep.

Sample Input 1

4
2 4
4 3
9 3
100 5

Sample Output 1

3

By removing Robot 2, we can keep the other three robots.

Sample Input 2

2
8 20
1 10

Sample Output 2

1

Sample Input 3

5
10 1
2 1
4 1
6 1
8 1

Sample Output 3

5

Solution in Ruby (2.3.3) (judge verdict: Accepted)

require 'pp'

n = gets.chomp!.to_i
x_n = Array.new(n)
l_n = Array.new(n)
n.times do |i|
    x, l = gets.split.map(&:to_i)
    x_n[i] = x
    l_n[i] = l
end

min_n = Array.new(n)
max_n = Array.new(n)

n.times do |i|
    min_n[i] = [x_n[i] - l_n[i], x_n[i] + l_n[i]]
    #max_n[i] = [min_n[i][1], min_n[i][0]]
end

min_n.sort!

i = 0
count = 1
head = 0
tail = 1
while tail < n
    #pp "====="
    #pp head
    #pp tail
    min1, max1 = min_n[head]
    min2, max2 = min_n[tail]
    if max1 <= min2
        count += 1
        head = tail
        tail = head + 1
    elsif max1 >= max2
        # i番目つかうメリットなし
        head += 1
        tail = head + 1
    else
        # i番目は使う可能性あり，i+1番目は使うメリットなし
        tail += 1
    end
end

puts count