#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
pair<int, int> p[maxn];
vector<pair<int, int> > num;
vector<int> vec, ves;
int x[maxn], t[maxn];
int main() {
  int n, m, f, g, v;
  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 = x[i] + v * t[i];
    p[i].second = v * t[i] - x[i];
    if (p[i].first >= 0 && p[i].second >= 0)
      num.push_back(make_pair(p[i].first, p[i].second));
  }
  sort(p, p + n);
  for (int i = 0; i < n; i++) {
    int it = upper_bound(vec.begin(), vec.end(), p[i].second) - vec.begin();
    if (it == vec.size())
      vec.push_back(p[i].second);
    else
      vec[it] = p[i].second;
  }
  num.push_back(make_pair(0, 0));
  sort(num.begin(), num.end());
  for (int i = 0; i < num.size(); i++) {
    int it = upper_bound(ves.begin(), ves.end(), num[i].second) - ves.begin();
    if (it == ves.size())
      ves.push_back(num[i].second);
    else
      ves[it] = num[i].second;
  }
  cout << ves.size() - 1 << "  " << vec.size();
}
