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;
int n, v, ans_free;
vector<pair<long long, long long> > a, f;
vector<long long> dp;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0, x, t; i < n; i++) {
    cin >> x >> t;
    a.emplace_back(x, t);
  }
  cin >> v;
  for (auto p : a)
    f.emplace_back(1ll * v * p.second + p.first, 1ll * v * p.second - p.first);
  sort(f.begin(), f.end());
  for (auto p : f) {
    int idx = upper_bound(dp.begin(), dp.end(), p.second) - dp.begin();
    if (idx == dp.size())
      dp.push_back(p.second);
    else
      dp[idx] = p.second;
  }
  ans_free = dp.size();
  dp.clear();
  for (auto p : f)
    if (p.first >= 0 && p.second >= 0) {
      int idx = upper_bound(dp.begin(), dp.end(), p.second) - dp.begin();
      if (idx == dp.size())
        dp.push_back(p.second);
      else
        dp[idx] = p.second;
    }
  cout << dp.size() << ' ' << ans_free;
}
