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 n, v, q[100008];
long long t[100008], x[100008];
struct node {
  long long a, b;
} a[100008];
int solve(int);
bool cmp(node a, node b) { return a.a < b.a; }
int main() {
  int i;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%lld %lld", &x[i], &t[i]);
  scanf("%d", &v);
  for (i = 1; i <= n; ++i) {
    a[i].a = x[i] + t[i] * v;
    a[i].b = -x[i] + t[i] * v;
  }
  sort(a + 1, a + n + 1, cmp);
  printf("%d %d", solve(1), solve(0));
  return 0;
}
int find(int l, int r, int m) {
  int mid, ans = r;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (a[q[mid]].b <= a[m].b)
      l = mid + 1;
    else {
      ans = mid;
      r = mid - 1;
    }
  }
  return ans;
}
int solve(int flg) {
  int i, k, top, ans = 0;
  top = flg;
  memset(q, 0, sizeof(q));
  for (i = 1; i <= n; ++i) {
    if (!top || a[q[top]].b <= a[i].b)
      q[++top] = i;
    else {
      k = find(1, top, i);
      if (k == 1 && flg) continue;
      q[k] = i;
    }
    ans = max(ans, top - flg);
  }
  return ans;
}
