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 n, v;
long long h[100001];
class Node {
 public:
  long long x, t;
  bool operator<(const Node& r) const {
    int u = (x + v * t) - (r.x + v * r.t);
    int c = (x - v * t) - (r.x - v * r.t);
    if (!u)
      return c < 0;
    else
      return u > 0;
  }
} a[100000];
void debug() {
  for (int i = 0; i <= n; i++) {
    if (h[i] > 1000000)
      printf("# ");
    else
      printf("%d ", h[i]);
  }
  puts("");
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d%I64d", &a[i].x, &a[i].t);
  scanf("%d", &v);
  sort(a, a + n);
  int s0 = -1, ss = -1;
  memset(h, 127, sizeof(h));
  h[0] = -100000000000000ll;
  for (int i = 0; i < n; i++) {
    long long u = a[i].x + v * a[i].t;
    long long c = a[i].x - v * a[i].t;
    if (u < 0) continue;
    if (s0 < 0 && c < 0) s0 = lower_bound(h, h + n + 1, 1) - h;
    int k = lower_bound(h, h + n + 1, c + 1) - h;
    h[k] = min(h[k], c);
    ss = max(ss, k);
  }
  if (s0 < 0) s0 = lower_bound(h, h + n + 1, 1) - h;
  printf("%d %d\n", s0, ss);
}
