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 N = 100010;
int x[N], t[N], s[N];
struct data {
  int a, b;
} w[N];
bool compare(data a, data b) {
  return (a.a < b.a || (a.a == b.a && a.b < b.b));
}
int main() {
  int n, v, i, l, r, mid, ans;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d %d", &x[i], &t[i]);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    w[i].a = t[i] * v + x[i];
    w[i].b = t[i] * v - x[i];
  }
  sort(w + 1, w + n + 1, compare);
  s[0] = 0;
  for (i = 1; i <= n; i++)
    if (s[0] == 0) {
      s[0]++;
      s[s[0]] = w[i].b;
    } else if (s[s[0]] <= w[i].b) {
      s[0]++;
      s[s[0]] = w[i].b;
    } else if (s[1] > w[i].b)
      s[1] = w[i].b;
    else {
      l = 1;
      r = s[0];
      while (l + 1 < r) {
        mid = (l + r) / 2;
        if (s[mid] > w[i].b)
          r = mid;
        else
          l = mid;
      }
      s[r] = w[i].b;
    }
  ans = s[0];
  s[0] = 0;
  for (i = 1; i <= n; i++)
    if (w[i].a >= 0 && w[i].b >= 0)
      if (s[0] == 0) {
        s[0]++;
        s[s[0]] = w[i].b;
      } else if (s[s[0]] <= w[i].b) {
        s[0]++;
        s[s[0]] = w[i].b;
      } else if (s[1] > w[i].b)
        s[1] = w[i].b;
      else {
        l = 1;
        r = s[0];
        while (l + 1 < r) {
          mid = (l + r) / 2;
          if (s[mid] > w[i].b)
            r = mid;
          else
            l = mid;
        }
        s[r] = w[i].b;
      }
  printf("%d %d", s[0], ans);
  return (0);
}
