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;
template <class T>
inline istream &operator>>(istream &str, vector<T> &a) {
  for (auto &i : a) str >> i;
  return str;
}
const long long INF = 1e18;
const long long inf = 1e9;
const long long N = 1e5 + 5;
const long double EPS = 1e-9;
const long long MOD = 1e9 + 7;
const long long A = 1e6 + 5;
long long find_n(const vector<pair<long long, long long>> &pp) {
  vector<long long> dp(pp.size() + 1, INF);
  dp[0] = -INF;
  for (long long i = 0; i < pp.size(); ++i) {
    long long x = pp[i].second;
    long long ind = upper_bound(dp.begin(), dp.end(), x) - dp.begin();
    dp[ind] = min(dp[ind], x);
  }
  long long len = (long long)pp.size();
  while (dp[len] == INF) {
    --len;
  }
  return len;
}
long long find_2(vector<pair<long long, long long>> pp) {
  pp.push_back({0, 0});
  sort(pp.begin(), pp.end());
  vector<long long> dp(pp.size() + 1, INF);
  dp[0] = -INF;
  long long f = 0;
  for (long long i = 0; i < pp.size(); ++i) {
    if (!f && pp[i] == make_pair(0LL, 0LL)) {
      f = 1;
      dp[1] = 0;
      continue;
    }
    if (!f) {
      continue;
    }
    long long x = pp[i].second;
    long long ind = upper_bound(dp.begin(), dp.end(), x) - dp.begin();
    if (f == 1 && ind == 1) {
      continue;
    }
    dp[ind] = min(dp[ind], x);
  }
  long long len = (long long)pp.size();
  while (dp[len] == INF) {
    --len;
  }
  return len;
}
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  long long n;
  cin >> n;
  vector<pair<long long, long long>> pp(n);
  for (long long i = 0; i < n; ++i) {
    long long x, t;
    cin >> x >> t;
    pp[i] = {x, t};
  }
  long long v;
  cin >> v;
  for (long long i = 0; i < n; ++i) {
    pp[i].second *= v;
    pp[i] = {-pp[i].first + pp[i].second, pp[i].first + pp[i].second};
  }
  sort(pp.begin(), pp.end());
  cout << find_2(pp) - 1 << ' ' << find_n(pp) << '\n';
  return 0;
}
