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 event {
  long long x, t;
};
long long n, v;
event e[100001];
long long dp[100001];
bool cmp(const event& a, const event& b) { return a.t < b.t; }
bool reachable(long long currx, long long currt, long long checkx,
               long long checkt) {
  if ((currt - checkt) * v >= abs(currx - checkx))
    return true;
  else
    return false;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> e[i].x >> e[i].t;
  sort(e, e + n, cmp);
  cin >> v;
  memset(dp, 0, sizeof(dp));
  for (long long i = 0; i < n; i++) {
    if (reachable(e[i].x, e[i].t, 0, 0)) dp[i] = 1;
    for (long long j = 0; j < i; j++) {
      if (reachable(e[i].x, e[i].t, e[j].x, e[j].t))
        dp[i] = max(dp[i], dp[j] + 1);
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) ans = max(ans, dp[i]);
  cout << ans << " ";
  for (long long i = 0; i < n; i++) dp[i] = 1;
  for (long long i = 1; i < n; i++) {
    for (long long j = 0; j < i; j++) {
      if (reachable(e[i].x, e[i].t, e[j].x, e[j].t))
        dp[i] = max(dp[i], dp[j] + 1);
    }
  }
  ans = 0;
  for (long long i = 0; i < n; i++) ans = max(ans, dp[i]);
  cout << ans;
}
