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 sys import stdin


def find_LIS(a, check):
    from math import inf
    if len(a) == 1:
        return 1

    n = len(a)
    d = [inf for i in range(n)]
    length = 0

    d[0] = -10**20 * check

    for i in range(0, n - 1):
        j = bisect.bisect(d, a[i])
        if d[j - 1] <= a[i] <= d[j]:
            d[j] = a[i]
            if j >= length:
                length = j

    if j == n:
        length += 1
    elif d[j-1] <= a[n-1] <= d[j]:
        length = max(length, j)
    return length


def main():
    n = int(stdin.readline())
    x = [0 for _ in range(n)]
    t = [0 for _ in range(n)]
    for i in range(n):
        x[i], t[i] = map(int, stdin.readline().split())
    v = int(stdin.readline())

    list_1 = list(map(lambda t: (-t[0] + v * t[1], t[0] + v * t[1]), zip(x, t)))

    list_1.sort()
    list_1_ = list(map(lambda t: t[1], list_1))
    res_1 = find_LIS(list_1_, 1)

    list_2_ = list(map(lambda t: t[0], list_1))
    j = bisect.bisect(list_2_, 0)

    list_1_.insert(j, 0)

    res_2 = find_LIS(list_1_[j:], 0)

    print(res_2, res_1)

main()
