#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, v;
struct point {
  long long x, t;
  long long a, val;
} p[N];
bool comp(const point& A, const point& B) {
  return A.a < B.a || (A.a == B.a && A.val < B.val);
}
long long s[N], top = 0;
void calc() {
  for (long long i = 1; i <= n; i++)
    if (p[i].a >= 0 && p[i].val >= 0) {
      if (s[top] <= p[i].val)
        s[++top] = p[i].val;
      else {
        long long k = upper_bound(s + 1, s + 1 + top, p[i].val) - s;
        s[k] = p[i].val;
      }
    }
  printf("%lld ", top);
  memset(s, 0, sizeof(s));
  top = 0;
  s[0] = -1e18;
  for (long long i = 1; i <= n; i++) {
    if (s[top] <= p[i].val)
      s[++top] = p[i].val;
    else {
      long long k = upper_bound(s + 1, s + 1 + top, p[i].val) - s;
      s[k] = p[i].val;
    }
  }
  printf("%lld", top);
  return;
}
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld %lld", &p[i].x, &p[i].t);
  scanf("%lld", &v);
  for (long long i = 1; i <= n; i++)
    p[i].val = p[i].t * v + p[i].x, p[i].a = p[i].t * v - p[i].x;
  sort(p + 1, p + 1 + n, comp);
  calc();
  return 0;
}
