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 maxn = 110000;
int n, V;
struct Tcxx {
  long long x, t;
} A[maxn];
namespace Ninit {
void init() {
  int i;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) cin >> A[i].x >> A[i].t;
  scanf("%d", &V);
}
}  // namespace Ninit
namespace Nsolve {
int m, an0;
long long B[maxn];
inline bool cmp(const Tcxx &a, const Tcxx &b) {
  return a.t * V + a.x != b.t * V + b.x ? a.t * V + a.x > b.t * V + b.x
                                        : a.t * V - a.x > b.t * V - b.x;
}
void solve() {
  int l, r, mid, i;
  long long x;
  sort(A + 1, A + n + 1, cmp);
  for (m = 1, B[0] = 1e18, i = 1; i <= n; ++i) {
    x = A[i].t * V - A[i].x;
    for (l = 0, r = m; l + 1 < r; x <= B[mid] ? l = mid : r = mid)
      mid = l + r >> 1;
    if (l + 1 == m)
      B[m++] = x;
    else
      B[l + 1] = max(B[l + 1], x);
    if (A[i].t * V >= abs(A[i].x)) an0 = max(an0, l + 1);
  }
  cout << an0 << ' ' << m - 1 << endl;
}
}  // namespace Nsolve
int main() {
  Ninit::init();
  Nsolve::solve();
  return 0;
}
