Tourist#2008
A tourist walks along the axis. He can move in either direction, at any speed not exceeding , or stay in place. He knows from newspaper announcements that at time t_1 at coordinate x_1 there will be one interesting event, at time t_2 at coordinate x_2 another one, and so on, up to (x_N, t_N). Interesting events are very short — they can be considered to happen instantaneously. An event is considered visited if at time t_i the tourist is at coordinate x_i.
Write a program to determine the maximum number of interesting events the tourist can visit under the following two assumptions:
At the beginning of the movement (at time ), the tourist is at point ;
The tourist can choose any starting point.
The first line contains a single integer (1 \leq N \leq 100\,000), the number of interesting events. The following lines each contain two integers x_i and t_i — the coordinate and time of the -th event. The last line contains a single integer — the maximum possible speed of the tourist. All x_i satisfy -10^8 \leq x_i \leq 10^8, all t_i satisfy 1 \leq t_i \leq 10^6, and 1 \leq V \leq 1000. There may be different events with the same coordinate or the same time , but not with both and equal.
Output a single line with two integers: the maximum number of events the tourist can visit if he starts at point at time , and then the maximum number of events if he can choose his starting point.
Example 1