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

#include <bits/stdc++.h>
using namespace std;
const int mm = 111111;
struct data {
  long long p, q;
} g[mm];
long long q[mm], x[mm], t[mm], v;
int i, j, n, r, ans;
bool cmp(data a, data b) { return a.p < b.p || (a.p == b.p && a.q < b.q); }
int find(int l, int r, long long x) {
  int m, ret = r + 1;
  while (l <= r) {
    m = (l + r) >> 1;
    if (q[m] > x)
      ret = m, r = m - 1;
    else
      l = m + 1;
  }
  return ret;
}
int main() {
  while (~scanf("%d", &n)) {
    for (i = 0; i < n; ++i) scanf("%I64d%I64d", &x[i], &t[i]);
    scanf("%I64d", &v);
    for (i = 0; i < n; ++i) {
      g[i].p = -x[i] + t[i] * v;
      g[i].q = x[i] + t[i] * v;
    }
    sort(g, g + n, cmp);
    q[r = 0] = -1e10, q[1] = 1e10;
    for (i = 0; i < n; ++i) {
      j = find(0, r, g[i].q);
      if (q[j] > g[i].q) q[j] = g[i].q;
      if (j >= r) q[++r] = 1e10;
    }
    ans = r;
    q[r = 0] = -1e10, q[1] = 1e10;
    for (i = 0; i < n; ++i)
      if (g[i].p >= 0 && g[i].q >= 0) {
        j = find(0, r, g[i].q);
        if (q[j] > g[i].q) q[j] = g[i].q;
        if (j >= r) q[++r] = 1e10;
      }
    printf("%d %d\n", r, ans);
  }
  return 0;
}
