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 = 100007;
const long long INF = 1000000000000000000;
struct event {
  long long p, q;
};
bool comp(const event a, const event b) {
  return ((a.p < b.p) || ((a.p == b.p) && (a.q < b.q)));
}
int main() {
  int n, i, ans1, ans2, l, r, mid;
  event ev[MAXN];
  long long x[MAXN], t[MAXN], v;
  long long dp[MAXN];
  cin >> n;
  for (i = 0; i < n; i++) cin >> x[i] >> t[i];
  cin >> v;
  for (i = 0; i < n; i++) {
    ev[i].p = x[i] + t[i] * v;
    ev[i].q = -x[i] + t[i] * v;
  }
  sort(ev, ev + n, comp);
  for (i = 0; i < MAXN; i++) dp[i] = INF;
  dp[0] = -INF;
  ans2 = 0;
  for (i = 0; i < n; i++) {
    l = 0;
    r = MAXN;
    while (r - l > 1) {
      mid = (l + r) / 2;
      if (dp[mid] > ev[i].q)
        r = mid;
      else
        l = mid;
    }
    l++;
    ans2 = max(ans2, l);
    dp[l] = ev[i].q;
  }
  for (i = 0; i < MAXN; i++) dp[i] = INF;
  dp[0] = -INF;
  dp[1] = 0;
  ans1 = 0;
  for (i = 0; i < n; i++) {
    if ((ev[i].p < 0) || (ev[i].q < 0)) continue;
    l = 0;
    r = MAXN;
    while (r - l > 1) {
      mid = (l + r) / 2;
      if (dp[mid] > ev[i].q)
        r = mid;
      else
        l = mid;
    }
    l++;
    if (l == 1) continue;
    ans1 = max(ans1, l - 1);
    dp[l] = ev[i].q;
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
