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;
using pii = pair<int, int>;
int const N = 1e5 + 10, inf = 1e18 + 10;
int n, v, x[N], t[N], dp1[N], dp2[N], mn1[N], mn2[N], ans1, ans2;
pii p[N];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> t[i];
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    p[i].first = v * t[i] - x[i];
    p[i].second = v * t[i] + x[i];
  }
  sort(p, p + n);
  mn1[0] = -inf, mn2[0] = -inf;
  fill(mn1 + 1, mn1 + N, inf);
  fill(mn2 + 1, mn2 + N, inf);
  for (int i = 0; i < n; i++) {
    int id = upper_bound(mn1, mn1 + N, p[i].second) - mn1;
    dp1[i] = id;
    mn1[id] = p[i].second;
    if (p[i].first >= 0 && p[i].second >= 0) {
      int id = upper_bound(mn2, mn2 + N, p[i].second) - mn2;
      dp2[i] = id;
      mn2[id] = p[i].second;
    }
    ans1 = max(ans1, dp1[i]);
    ans2 = max(ans2, dp2[i]);
  }
  cout << ans2 << ' ' << ans1 << '\n';
}
