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 x[110000], t[110000];
int n, v;
int lsh[110000];
int tr[110000];
struct data {
  int a, b;
} node[110000];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
inline bool cmp(data a, data b) {
  if (a.a == b.a) return a.b < b.b;
  return a.a < b.a;
}
inline int lb(int x) { return x & (-x); }
inline void upd(int pos, int x) {
  for (int i = pos; i <= n; i += lb(i)) tr[i] = max(tr[i], x);
}
inline int ask(int pos) {
  int ans = -1000;
  for (int i = pos; i; i -= lb(i)) ans = max(ans, tr[i]);
  return ans;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) x[i] = read(), t[i] = read();
  v = read();
  for (int i = 1; i <= n; i++)
    node[i].a = -x[i] + v * t[i], lsh[i] = node[i].b = x[i] + v * t[i];
  sort(node + 1, node + 1 + n, cmp);
  sort(lsh + 1, lsh + 1 + n);
  int tot = unique(lsh + 1, lsh + 1 + n) - lsh - 1;
  for (int i = 1; i <= n; i++)
    node[i].b = lower_bound(lsh + 1, lsh + tot, node[i].b) - lsh;
  int ans1 = 0;
  for (int i = 1; i <= n; i++) {
    if (node[i].a < 0 || node[i].b < 0) continue;
    int tmp = max(1, ask(node[i].b) + 1);
    upd(node[i].b, tmp);
    ans1 = max(ans1, tmp);
  }
  memset(tr, 0xc0, sizeof(tr));
  int ans2 = 0;
  for (int i = 1; i <= n; i++) {
    int tmp = max(1, ask(node[i].b) + 1);
    upd(node[i].b, tmp);
    ans2 = max(ans2, tmp);
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
