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 long long INF = 1e9 + 10;
const long long MN = 1e5 + 10;
long long n;
long long t[MN], d[MN], V, lis[MN];
long long Lis(vector<pair<long long, long long> >& vec) {
  fill(lis, lis + MN, (long long)1e18);
  for (auto x : vec) {
    long double val = x.second;
    long long ind = upper_bound(lis, lis + MN, val) - lis;
    lis[ind] = x.second;
  }
  for (long long i = 0; i < MN; ++i)
    if (lis[i] >= 1e18) return i;
}
int32_t main() {
  ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n; ++i) cin >> d[i] >> t[i];
  cin >> V;
  vector<pair<long long, long long> > T1, T2;
  for (long long i = 0; i < n; ++i) {
    T1.push_back({d[i] + t[i] * V, t[i] * V - d[i]});
    if ((-1) * V * t[i] <= d[i] && d[i] <= V * t[i])
      T2.push_back({d[i] + t[i] * V, t[i] * V - d[i]});
  }
  sort(T1.begin(), T1.end()), sort(T2.begin(), T2.end());
  cout << Lis(T2) << ' ' << Lis(T1) << '\n';
  return 0;
}
