#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int n, V, n1;
pair<int, int> p[111111];
int v[222222];
int s[222222];
void setVal(int p, int val) {
  p += 111111;
  while (p) {
    s[p] = max(s[p], val);
    p >>= 1;
  }
}
int getMax(int p) {
  int res = 0;
  p += 111111;
  int end = -1 + 2 * 111111;
  while (p <= end) {
    res = max(res, s[p]);
    res = max(res, s[end]);
    p = (p + 1) >> 1;
    end = (end - 1) >> 1;
  }
  return res;
}
pair<int, int> q[111111];
int main() {
  int t = 1;
  while (t--) {
    cin >> n;
    for (int i(0); i < (n); i++) scanf("%d %d", &p[i].first, &p[i].second);
    cin >> V;
    for (int i(0); i < (n); i++) {
      int p1 = p[i].first - int(V) * p[i].second;
      int p2 = p[i].first + int(V) * p[i].second;
      v[i] = p2;
      q[i] = make_pair(p1, -p2);
    }
    sort(q, q + n);
    for (int i(0); i < (n); i++) q[i].second *= (-1);
    sort(v, v + n);
    n1 = unique(v, v + n) - v;
    int res = 0;
    int vv2 = 0;
    bool checkF = false;
    for (int i(0); i < (n); i++) {
      if (q[i].first > 0 && !checkF) {
        checkF = true;
        vv2 = getMax(lower_bound(v, v + n1, 0) - v);
      }
      int p = lower_bound(v, v + n1, q[i].second) - v;
      int val = getMax(p) + 1;
      setVal(p, val);
      res = max(res, val);
    }
    if (!checkF) vv2 = getMax(lower_bound(v, v + n1, 0) - v);
    cout << vv2 << ' ' << res << endl;
  }
  return 0;
}
