#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10;
typedef struct aa {
  long long a, b;
  bool operator<(const aa& o) const { return a < o.a || (a == o.a && b < o.b); }
} per;
per si[maxn];
long long n, x[maxn], t[maxn], v, z[maxn], cur, ans1, ans2;
long long find_pos(long long num) {
  long long l = 1, r = cur;
  while (l < r) {
    long long mid = (l + r) / 2;
    if (si[z[mid]].b > num)
      r = mid;
    else
      l = mid + 1;
  }
  return r;
}
signed main() {
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    scanf("%lld%lld", &x[i], &t[i]);
  }
  cin >> v;
  for (long long i = 1; i <= n; ++i) {
    si[i].a = x[i] + v * t[i];
    si[i].b = -x[i] + v * t[i];
  }
  sort(si + 1, si + 1 + n);
  for (long long i = 1; i <= n; ++i) {
    if (cur == 0 || (si[i].b >= si[z[cur]].b))
      z[++cur] = i;
    else {
      long long temp = find_pos(si[i].b);
      z[temp] = i;
    }
  }
  ans2 = cur;
  cur = 0;
  for (long long i = 1; i <= n; ++i) {
    if (si[i].a < 0 || si[i].b < 0) continue;
    if (cur == 0 || (si[i].b >= si[z[cur]].b))
      z[++cur] = i;
    else {
      long long temp = find_pos(si[i].b);
      z[temp] = i;
    }
  }
  ans1 = cur;
  cout << ans1 << ' ' << ans2;
  return 0;
}
