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>
const int N = (int)(1e5);
int n, x[N], t[N];
std::pair<long long, long long> a[N];
long long v;
long long s[N + 1];
int top;
int solve0() {
  top = 0;
  s[top++] = 0;
  for (int i = std::lower_bound(a, a + n, std::make_pair(0LL, 0LL)) - a; i < n;
       ++i) {
    if (a[i].second < 0) {
      continue;
    }
    if (top == 0 || s[top - 1] <= a[i].second) {
      s[top++] = a[i].second;
    } else {
      int at = std::upper_bound(s, s + top, a[i].second) - s;
      s[at] = a[i].second;
    }
  }
  return top - 1;
}
int solve1() {
  top = 0;
  for (int i = 0; i < n; ++i) {
    if (top == 0 || s[top - 1] <= a[i].second) {
      s[top++] = a[i].second;
    } else {
      int at = std::upper_bound(s, s + top, a[i].second) - s;
      s[at] = a[i].second;
    }
  }
  return top;
}
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) {
    a[i] = std::make_pair(v * t[i] - x[i], v * t[i] + x[i]);
  }
  std::sort(a, a + n);
  printf("%d %d\n", solve0(), solve1());
  return 0;
}
