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 kMaxN = 100000;
std::pair<int, int> p[kMaxN + 1];
int yl[kMaxN + 2], nyl;
int cnt[kMaxN + 2];
int n;
int GetMax(int x) {
  int result = -1;
  while (x >= 0) {
    result = std::max(result, cnt[x]);
    x = (x & (x + 1)) - 1;
  }
  return result;
}
void Insert(int x, int y) {
  while (x < nyl) {
    cnt[x] = std::max(cnt[x], y);
    x = x | (x + 1);
  }
}
int Calc() {
  memset(cnt, -1, sizeof(cnt));
  Insert(std::lower_bound(yl, yl + nyl, p[0].second) - yl, 0);
  for (int i = 1; i <= n; ++i) {
    int yid = std::lower_bound(yl, yl + nyl, p[i].second) - yl;
    int t = GetMax(yid) + 1;
    if (t > 0) Insert(yid, t);
  }
  return GetMax(n + 1);
}
int main() {
  int V, x, y;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &x, &y);
    p[i] = std::pair<int, int>(x, y);
  }
  scanf("%d", &V);
  for (int i = 1; i <= n; ++i) p[i].second *= V;
  for (int i = 1; i <= n; ++i)
    p[i] =
        std::pair<int, int>(p[i].second + p[i].first, p[i].second - p[i].first);
  for (int i = 1; i <= n; ++i) yl[i] = p[i].second;
  yl[0] = 0;
  yl[n + 1] = -2000000000;
  nyl = n + 2;
  std::sort(yl, yl + nyl);
  nyl = std::unique(yl, yl + nyl) - yl;
  std::sort(p + 1, p + n + 1);
  p[0] = std::pair<int, int>(0, 0);
  printf("%d ", Calc());
  p[0] = std::pair<int, int>(-2000000000, -2000000000);
  printf("%d\n", Calc());
  return 0;
}
