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>
long long Left[101000], Right[101000];
int x[101000], t[101000], n, V, s[101000], p[101000], f[101000], L, R, MAX, Ans,
    Ans2;
bool cmp(int a, int b) {
  return Left[a] == Left[b] ? t[a] < t[b] : Left[a] < Left[b];
}
int main() {
  int i;
  scanf("%d", &n);
  for (i = 1; i <= n; p[i] = i++) {
    scanf("%d%d", x + i, t + i);
    if (t[i] > MAX) MAX = t[i];
  }
  n++;
  scanf("%d", &V);
  for (i = 0; i < n; i++) {
    Left[i] = x[i] - 1ll * (MAX - t[i]) * V;
    Right[i] = x[i] + 1ll * (MAX - t[i]) * V;
  }
  std::sort(p, p + n, cmp);
  for (i = n - 1; i >= 0; i--) {
    L = 0;
    R = Ans + 1;
    for (; L + 1 < R;)
      if (Right[s[(L + R) / 2]] <= Right[p[i]])
        L = (L + R) / 2;
      else
        R = (L + R) / 2;
    if (!Ans || Right[s[L]] > Right[p[i]])
      f[p[i]] = 1;
    else
      f[p[i]] = f[s[L]] + 1;
    if (f[p[i]] > Ans) Ans = f[p[i]];
    if (p[i] && f[p[i]] > Ans2) Ans2 = f[p[i]];
    if (Right[s[f[p[i]]]] > Right[p[i]]) s[f[p[i]]] = p[i];
  }
  printf("%d %d\n", f[0] - 1, Ans2);
  return 0;
}
