12
-6712 6
2375 73
4643 197
-5660 215
-378 223
2228 307
3305 340
3449 468
-4389 707
-7161 729
-1838 921
-1655 985
730
 5
1 5
6 7
17127 17
17072 42
17042 77
3
 7
-976754 20479
79929143 911181
9598220 82517
-51609349 810257
67416551 266544
-14170975 307690
-15476178 491195
352
 22
-5301 602
-1400 194
-8512 987
-282 962
6484 494
9091 523
-7744 92
6002 461
5053 305
-1339 272
-821 165
9308 785
929 421
8384 883
1266 157
8411 923
-2949 885
7725 687
6859 197
-7630 867
5031 918
5662 410
41

11 12
 2 3
 5 5
 9 9

import bisect
from math import inf


def find_LIS(a):
    n = len(a)
    d = [(inf, inf) for i in range(n)]
    pos = [0 for i in range(n)]
    prev = [0 for i in range(n-1)]
    length = 0
    pos[0] = -1
    d[0] = (-inf, -inf)
    for i in range(n-1):
        j = bisect.bisect(d, a[i])
        if d[j-1] < a[i] < d[j]:
            d[j] = a[i]
            pos[j] = i
            prev[i] = pos[j-1]
            length = max(length, j)

    return length


n = int(input())
x = [0 for _ in range(n)]
t = [0 for _ in range(n)]
for i in range(n):
    x_, t_ = map(int, input().split())
    x[i] = x_
    t[i] = t_
v = int(input())

list_1 = [0 for i in range(n)]
list_2 = [(0, 0) for i in range(n+1)]

for i in range(n):
    a = (-x[i] + v * t[i], x[i] + v * t[i])
    list_1[i] = a
    list_2[i+1] = a

list_1.sort()
list_2.sort()

list_2[:list_2.index((0,0))] = []

print(list_1)
print(list_2)

res_1 = find_LIS(list_1)
res_2 = find_LIS(list_2)

print(res_2, res_1)
