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>
int a[100010][2];
int b[100010];
int n, v;
int cmp(const void *aa, const void *bb) {
  int *a = (int *)aa, *b = (int *)bb;
  if (a[0] < b[0])
    return -1;
  else if (a[0] > b[0])
    return 1;
  else if (a[1] > b[1])
    return -1;
  else if (a[1] < b[1])
    return 1;
  return 0;
}
int cal(int a[][2], int n) {
  int l, r, i, ret = 0;
  b[ret++] = a[0][1];
  for (i = 1; i < n; i++) {
    if (a[i][0] < a[0][0]) continue;
    for (l = 0, r = ret; l < r;)
      if (b[(l + r) / 2] >= a[i][1])
        l = (l + r) / 2 + 1;
      else
        r = (l + r) / 2;
    if (l == 0) continue;
    b[l] = a[i][1];
    if (l == ret) ret++;
  }
  return ret;
}
int main() {
  int i, x, t;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d %d", &a[i][0], &a[i][1]);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    x = a[i][0], t = a[i][1];
    a[i][0] = x + v * t;
    a[i][1] = x - v * t;
  }
  qsort(a + 1, n, sizeof(a[0]), cmp);
  a[0][0] = a[0][1] = 0;
  t = cal(a, n + 1);
  a[0][1] = 2000000000;
  printf("%d %d\n", t - 1, cal(a, n));
  return 0;
}
