#include <bits/stdc++.h>
using namespace std;
const long maxn = 100001;
struct node {
  long x, y;
};
node a[maxn];
long s[maxn], p[maxn], f[maxn], t[maxn];
long n, m;
long find(long x) {
  long l = 0, r = m, mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (p[mid] == x)
      return mid;
    else if (p[mid] < x)
      l = mid + 1;
    else
      r = mid - 1;
  }
}
long add(long i, long k) {
  while (i <= m + 2) {
    if (k > s[i]) s[i] = k;
    i += i & (-i);
  }
  return 0;
}
long get(long i) {
  long ans = 0;
  while (i > 0) {
    if (s[i] > ans) ans = s[i];
    i -= i & (-i);
  }
  return ans;
}
long work_fir() {
  long ans = 0;
  memset(s, 0, sizeof(s));
  memset(f, 0, sizeof(f));
  for (long i = 0; i != n; ++i)
    if (a[i].x >= 0 && a[i].y >= 0) {
      f[i] = get(find(a[i].y) + 1) + 1;
      add(find(a[i].y) + 1, f[i]);
      if (f[i] > ans) ans = f[i];
    }
  return ans;
}
long work_sec() {
  long ans = 0;
  memset(s, 0, sizeof(s));
  memset(f, 0, sizeof(f));
  for (long i = 0; i != n; ++i) {
    f[i] = get(find(a[i].y) + 1) + 1;
    add(find(a[i].y) + 1, f[i]);
    if (f[i] > ans) ans = f[i];
  }
  return ans;
}
bool tmp(node a, node b) { return (a.x < b.x || (a.x == b.x && a.y < b.y)); }
int init() {
  scanf("%d", &n);
  for (long i = 0; i != n; ++i) scanf("%d%d", &a[i].x, &a[i].y);
  long v, x, t;
  scanf("%d", &v);
  for (long i = 0; i != n; ++i) {
    x = a[i].x;
    t = a[i].y * v;
    a[i].x = -x + t;
    a[i].y = x + t;
    p[i] = a[i].y;
  }
  sort(a, a + n, tmp);
  sort(p, p + n);
  m = 0;
  for (int i = 1; i != n; ++i)
    if (p[i] != p[m]) p[++m] = p[i];
  return 0;
}
int main() {
  init();
  printf("%d %d\n", work_fir(), work_sec());
  return 0;
}
