#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const long long INF = 1e12;
struct node {
  long long a, b;
} mt[N];
long long q[N], x[N], t[N], v;
int n, r, ans1, ans2;
inline bool cmp(node a, node b) { return a.a == b.a ? a.b < b.b : a.a < b.a; }
int find(int l, int r, long long x) {
  int res = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (q[mid] > x)
      res = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &t[i]);
  scanf("%lld", &v);
  for (int i = 1; i <= n; i++) {
    mt[i].a = -x[i] + t[i] * v;
    mt[i].b = x[i] + t[i] * v;
  }
  sort(mt + 1, mt + 1 + n, cmp);
  q[0] = -INF, q[r = 1] = INF;
  for (int i = 1; i <= n; i++) {
    int pos = find(0, r, mt[i].b);
    if (q[pos] > mt[i].b) q[pos] = mt[i].b;
    if (pos >= r) q[++r] = INF;
  }
  ans2 = r - 1;
  q[r = 1] = INF;
  for (int i = 1; i <= n; i++)
    if (mt[i].a >= 0 && mt[i].b >= 0) {
      int pos = find(0, r, mt[i].b);
      if (q[pos] > mt[i].b) q[pos] = mt[i].b;
      if (pos >= r) q[++r] = INF;
    }
  ans1 = r - 1;
  printf("%d %d\n", ans1, ans2);
  return 0;
}
