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 kMaxN = 100000;
int n, v, memo[kMaxN + 1], *dp = memo + 1;
long long seq[kMaxN];
int m;
struct Node {
  int x, t;
  long long a, b;
  bool operator<(const Node &t) const {
    if (a != t.a) return (a > t.a);
    return (b < t.b);
  }
} node[kMaxN];
struct IndexTree {
  int v[kMaxN + 1], r[kMaxN + 1];
  void add(int i, int d) {
    if (d <= r[i]) return;
    r[i] = d;
    for (; i <= m; i += ((i) & (-(i)))) v[i] = max(v[i], d);
  }
  int sum(int i) {
    int res = 0;
    for (; i; i -= ((i) & (-(i)))) res = max(res, v[i]);
    return res;
  }
} idt;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d%d", &node[i].x, &node[i].t);
  scanf("%d", &v);
  for (int i = 0; i < n; ++i) {
    node[i].a = node[i].x - (long long)v * node[i].t;
    node[i].b = node[i].x + (long long)v * node[i].t;
    seq[i] = node[i].b;
  }
  sort(node, node + n);
  sort(seq, seq + n);
  m = unique(seq, seq + n) - seq;
  for (int i = 0; i < n; ++i) {
    int p = lower_bound(seq, seq + m, node[i].b) - seq;
    dp[i] = 1 + idt.sum(p + 1);
    idt.add(p + 1, dp[i]);
  }
  int ans1 = 0, ans2 = 0;
  for (int i = 0; i < n; ++i) {
    ans2 = max(ans2, dp[i]);
    if (abs(node[i].x) <= (long long)v * node[i].t) {
      ans1 = max(ans1, dp[i]);
    }
  }
  printf("%d %d\n", ans1, ans2);
  return 0;
}
