Description

The clique problem is one of the most well-known NP-complete problems. Under some simplification it can be formulated as follows. Consider an undirected graph G. It is required to find a subset of vertices C of the maximum size such that any two of them are connected by an edge in graph G. Sounds simple, doesn't it? Nobody yet knows an algorithm that finds a solution to this problem in polynomial time of the size of the graph. However, as with many other NP-complete problems, the clique problem is easier if you consider a specific type of a graph.Consider n distinct points on a line. Let the i-th point have the coordinate xi and weight wi. Let's form graph G, whose vertices are these points and edges connect exactly the pairs of points (i, j), such that the distance between them is not less than the sum of their weights, or more formally: |xi - xj| ≥ wi + wj.Find the size of the maximum clique in such graph.

 

Input

The first line contains the integer n (1 ≤ n ≤ 200 000) — the number of points.Each of the next n lines contains two numbers xi, wi (0 ≤ xi ≤ 109, 1 ≤ wi ≤ 109) — the coordinate and the weight of a point. All xi are different.

 

Output

 

Print a single number — the number of vertexes in the maximum clique of the given graph.

 

 

 

Sample Input

Input

42 33 16 10 2

 

Output

3

 

    假设点Xi>Xj，那么绝对值符号可以去掉，即Xi-Xj≥Wi+Wj。移项可以得到Xi-Wi≥Xj+Wj。这样的话，其实就确定了一个有向图的关系，题目转化为找结点数最多的有向图。运用贪心的思想，肯定希望第一个结点的坐标尽量小，以便于容纳更多的结点。因此事先计算出P(X+W,X-W)后放入vector，排序后从第一个点开始尝试，只要满足这样的关系式就努力往后拓展。这样得到的有向图结点数一定是最多的。

 

1 #pragma comment(linker, "/STACK:1024000000,1024000000") 2 #include
         
           3 #include
          
            4 #include
           
             5 #include
            
              6 #include
             
               7 #include
              
                8 #include
               
                 9 #include
                
                 10 #include
                 
                  11 #include