#include <bits/stdc++.h>
using namespace std;
struct node {
  long long p, q;
  int id;
};
int n, v, len, ans1, ans2;
int x[100010], t[100010];
long long que[100010];
node event[100010];
bool cmp(const node &a, const node &b) {
  return a.p < b.p || (a.p == b.p && a.q < b.q);
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%d%d", x + i, t + i);
    scanf("%d", &v);
    for (int i = 0; i < n; i++) {
      event[i].p = (long long)x[i] + (long long)t[i] * v;
      event[i].q = -(long long)x[i] + (long long)t[i] * v;
      event[i].id = 0;
    }
    event[n].p = 0;
    event[n].q = 0;
    event[n].id = -1;
    n++;
    sort(event, event + n, cmp);
    len = 0;
    que[0] = -(long long)0x3fffffff * 0x3fffffff;
    ans1 = ans2 = 0;
    for (int i = n - 1; i >= 0; i--) {
      long long x = -event[i].q;
      int pos = upper_bound(que + 1, que + len + 1, x) - que;
      if (pos == len + 1)
        que[++len] = x;
      else
        que[pos] = x;
      if (event[i].id == -1)
        ans1 = max(ans1, pos - 1);
      else
        ans2 = max(ans2, pos);
    }
    printf("%d %d\n", ans1, ans2);
  }
  return 0;
}
