#include <bits/stdc++.h>
using namespace std;
const int N = 250005;
const long long inf = 1LL << 60;
int n;
long long x[N], y[N], v, b[N];
pair<long long, long long> a[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    y[i] *= v;
  }
  int m = 0;
  for (int i = 0; i < n; i++) {
    if (x[i] + y[i] >= 0 && y[i] - x[i] >= 0)
      a[m++] = make_pair(x[i] + y[i], y[i] - x[i]);
  }
  sort(a, a + m);
  fill(b, b + m, inf);
  for (int i = 0; i < m; i++) {
    *upper_bound(b, b + m, a[i].second) = a[i].second;
  }
  printf("%d\n", lower_bound(b, b + m, inf) - b);
  for (int i = 0; i < n; i++) {
    a[i] = make_pair(x[i] + y[i], y[i] - x[i]);
  }
  sort(a, a + n);
  fill(b, b + n, inf);
  for (int i = 0; i < n; i++) {
    *upper_bound(b, b + n, a[i].second) = a[i].second;
  }
  printf("%d\n", lower_bound(b, b + n, inf) - b);
  return 0;
}
