#include <bits/stdc++.h>
using namespace std;
bool flag;
struct node {
  int p, q;
  bool mark;
  bool operator<(const node& x) const {
    if (!flag) return q < x.q;
    if (p != x.p) return p > x.p;
    if (q != x.q) return q > x.q;
    return x.mark;
  }
};
node a[100001];
int temp, d[100001], t[100001], f[100001];
void ins(int l, int r, int x) {
  int mid = (l + r) / 2;
  if (x == mid) {
    temp = max(temp, f[mid]) + 1;
    f[mid] = max(f[mid], temp);
    return;
  }
  if (x < mid) {
    temp = max(temp, f[mid]);
    ins(l, mid, x);
    return;
  }
  ins(mid + 1, r, x);
  f[mid] = max(f[mid], temp);
}
int find(int l, int r, int x) {
  int mid = (l + r) / 2;
  if (x == mid) return max(temp, f[mid]);
  if (x < mid) {
    temp = max(temp, f[mid]);
    return find(l, mid, x);
  }
  return find(mid + 1, r, x);
}
int main(void) {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d %d", &d[i], &t[i]);
  int v;
  scanf("%d", &v);
  for (int i = 1; i <= n; ++i) {
    a[i].p = -d[i] + t[i] * v;
    a[i].q = d[i] + t[i] * v;
    a[i].mark = false;
  }
  a[0].p = 0;
  a[0].q = 0;
  a[0].mark = true;
  sort(a, a + n + 1);
  temp = a[0].q;
  a[0].q = 1;
  int m = 1;
  for (int i = 1; i <= n; ++i) {
    if (a[i].q != temp) {
      temp = a[i].q;
      ++m;
    }
    a[i].q = m;
  }
  flag = true;
  sort(a, a + n + 1);
  int ans1 = 0, ans2 = 0;
  for (int i = 0; i <= n; ++i) {
    if (a[i].mark) {
      temp = 0;
      ans1 = find(1, m, a[i].q);
      continue;
    }
    temp = 0;
    ins(1, m, a[i].q);
    ans2 = max(ans2, temp);
  }
  printf("%d %d\n", ans1, ans2);
  return 0;
}
