#include <bits/stdc++.h>
using namespace std;
struct unit {
  int x, y;
};
struct unit a[100010];
int n, m, v, n1, k, ans1, ans2;
int sa[100010], c[100010], f[100010];
bool cmp(struct unit aa, struct unit bb) {
  return aa.x < bb.x || (aa.x == bb.x && aa.y < bb.y);
};
int query(int i) {
  int ret = 0;
  while (i > 0) {
    ret = max(ret, c[i]);
    i -= i & (-i);
  }
  return ret;
}
void change(int i, int x) {
  if (x > c[i]) {
    while (i <= n) {
      c[i] = max(c[i], x);
      i += i & (-i);
    }
  }
}
void work() {
  int i;
  for (i = 1; i <= n; i++) {
    if (i != k) f[i] = max(f[i], query(a[i].y) + 1);
    change(a[i].y, f[i]);
  }
}
int main() {
  int i, j, x, y;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d%d", &a[i].x, &a[i].y);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    x = a[i].x;
    y = a[i].y;
    a[i].x = x + v * y;
    a[i].y = -x + v * y;
    n1++;
    sa[n1] = a[i].y;
  }
  n++;
  a[n].x = 0;
  a[n].y = 0;
  sort(a + 1, a + n + 1, cmp);
  sort(sa + 1, sa + n1 + 1);
  for (i = 1; i <= n; i++) {
    if (a[i].x == 0 && a[i].y == 0) k = i;
    a[i].y = lower_bound(sa + 1, sa + n1 + 1, a[i].y) - sa;
  }
  f[k] = -100000;
  memset(c, 0, sizeof(c));
  work();
  for (i = 1; i <= n; i++) ans2 = max(ans2, f[i]);
  f[k] = 100000;
  memset(c, 0, sizeof(c));
  work();
  for (i = 1; i <= n; i++) ans1 = max(ans1, f[i] - 100000);
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
