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;
int i, j, n, l, r, h, xx[100100], yy[100100], k[100100], f[100100], s[100100];
long long x[100100], y[100100], nx[100100], ny[100100], v;
bool cmp(int i, int j) { return x[i] < x[j] || (x[i] == x[j] && y[i] < y[j]); }
int main() {
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d%d", &xx[i], &yy[i]);
  scanf("%I64d", &v);
  for (i = 0; i < n; i++) {
    nx[i] = x[i] = -xx[i] - v * yy[i];
    ny[i] = y[i] = xx[i] - v * yy[i];
  }
  sort(nx, nx + n + 1);
  sort(ny, ny + n + 1);
  for (i = 0; i <= n; i++) {
    l = 0;
    r = n;
    while (l < r) {
      h = (l + r) / 2;
      if (x[i] > nx[h])
        l = h + 1;
      else
        r = h;
    }
    x[i] = r + 1;
    l = 0;
    r = n;
    while (l < r) {
      h = (l + r) / 2;
      if (y[i] > ny[h])
        l = h + 1;
      else
        r = h;
    }
    y[i] = r + 1;
    k[i] = i;
  }
  sort(k, k + n + 1, cmp);
  for (r = i = 0; i <= n; i++) {
    for (j = y[k[i]]; j > 0; j &= j - 1) f[i] = max(f[i], s[j]);
    if (k[i] != n) {
      if (++f[i] > r) r = f[i];
      for (j = y[k[i]]; j <= n + 10; j = (j << 1) - (j & (j - 1)))
        s[j] = max(s[j], f[i]);
    } else
      l = f[i];
  }
  printf("%d %d\n", l, r);
  return 0;
}
