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 N = 1e5 + 10;
const long long INF = 1e12;
struct node {
  long long a, b;
} mt[N];
long long q[N], x[N], t[N], v;
int n, r, ans1, ans2;
inline bool cmp(node a, node b) { return a.a == b.a ? a.b < b.b : a.a < b.a; }
int find(int l, int r, long long x) {
  int res = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (q[mid] > x)
      res = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &t[i]);
  scanf("%lld", &v);
  for (int i = 1; i <= n; i++) {
    mt[i].a = -x[i] + t[i] * v;
    mt[i].b = x[i] + t[i] * v;
  }
  sort(mt + 1, mt + 1 + n, cmp);
  q[0] = -INF, q[r = 1] = INF;
  for (int i = 1; i <= n; i++) {
    int pos = find(0, r, mt[i].b);
    if (q[pos] > mt[i].b) q[pos] = mt[i].b;
    if (pos >= r) q[++r] = INF;
  }
  ans2 = r - 1;
  q[r = 1] = INF;
  for (int i = 1; i <= n; i++)
    if (mt[i].a >= 0 && mt[i].b >= 0) {
      int pos = find(0, r, mt[i].b);
      if (q[pos] > mt[i].b) q[pos] = mt[i].b;
      if (pos >= r) q[++r] = INF;
    }
  ans1 = r - 1;
  printf("%d %d\n", ans1, ans2);
  return 0;
}
