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;
long long lmax;
struct point {
  long long x, t, p, q;
};
long long n;
long long v;
point A[100001];
long long X[100001];
int ls;
bool var;
int f(point a, point b) {
  if (a.p != b.p) return a.p < b.p;
  return a.q < b.q;
}
int find(int b, int n) {
  if (A[b].q == -lmax) b++;
  ls = 2;
  X[1] = A[b].q;
  for (int i = b + 1; i <= n; i++) {
    int idx = (int)(upper_bound(X, X + ls, A[i].q) - X);
    if (idx == ls)
      X[ls++] = A[i].q;
    else
      X[idx] = A[i].q;
  }
  return ls - 1;
}
int main() {
  var = false;
  lmax = (long long)1000000000 * (long long)1000000000;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> A[i].x >> A[i].t;
    if (A[i].x == 0 && A[i].t == 0) var = true;
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    A[i].p = -A[i].x + A[i].t * v;
    A[i].q = A[i].x + A[i].t * v;
  }
  if (!var) {
    A[n].p = A[n].q = 0;
    sort(A, A + (n + 1), f);
    int idx = 0;
    while (A[idx].p != 0 || A[idx].q != 0) idx++;
    cout << find(idx, n) - 1 << " ";
    A[idx].q = -lmax;
    cout << find(0, n) << endl;
  } else {
    sort(A, A + n, f);
    int idx = 0;
    while (A[idx].p != 0 || A[idx].q != 0) idx++;
    cout << find(idx, n - 1) << " " << find(0, n - 1) << endl;
  }
  return 0;
}
