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 N, x[100010], t[100010];
struct point {
  long long x, y;
  bool operator<(const point& p) const {
    return x < p.x || (x == p.x && y < p.y);
  }
} P[100010];
long long V, f[100010];
int len;
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) scanf("%d%d", x + i, t + i);
  scanf("%I64d", &V);
  for (int i = 0; i < N; i++) P[i] = (point){V * t[i] - x[i], V * t[i] + x[i]};
  std::sort(P, P + N);
  f[0] = -(1ll << 62);
  for (int i = 0; i < N; i++)
    if (P[i].x >= 0 && P[i].y >= 0) {
      if (P[i].y >= f[len])
        f[++len] = P[i].y;
      else
        *std::upper_bound(f, f + len + 1, P[i].y) = P[i].y;
    }
  printf("%d ", len);
  len = 0;
  for (int i = 0; i < N; i++) {
    if (P[i].y >= f[len])
      f[++len] = P[i].y;
    else
      *std::upper_bound(f, f + len + 1, P[i].y) = P[i].y;
  }
  printf("%d\n", len);
}
