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;
struct node {
  int a, b;
} A[(int)(1e5 + 5)];
int q[(int)(1e5 + 5)], x[(int)(1e5 + 5)], t[(int)(1e5 + 5)], n, V;
bool cmp(node x, node y) { return x.a == y.a ? x.b < y.b : x.a < y.a; }
int fd(int l, int r, int x) {
  int ret = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (q[mid] > x)
      ret = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  return ret;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i] >> t[i];
  cin >> V;
  for (int 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 + 1 + n, cmp);
  int r = 0;
  q[0] = -0x7ffffff;
  for (int i = 1; i <= n; i++) {
    if (A[i].b >= q[r])
      q[++r] = A[i].b;
    else {
      int p = fd(1, r, A[i].b);
      q[p] = A[i].b;
    }
  }
  int ans1, ans2 = r;
  r = 0;
  q[0] = -0x7fffffff;
  for (int i = 1; i <= n; i++) {
    if (A[i].b >= 0 && A[i].a >= 0) {
      if (A[i].b >= q[r])
        q[++r] = A[i].b;
      else {
        int p = fd(1, r, A[i].b);
        q[p] = A[i].b;
      }
    }
  }
  ans1 = r;
  cout << ans1 << " " << ans2;
  return 0;
}
