#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, i, x, y, s, v, ans2;
int B[N];
pair<int, int> A[N], C[N];
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d %d", &A[i].first, &A[i].second);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    A[i] =
        make_pair(A[i].second * v - A[i].first, A[i].second * v + A[i].first);
    C[i] = A[i];
  }
  A[0] = make_pair(0, 0);
  sort(A, A + n + 1);
  for (i = 0; i <= n; i++) A[i] = make_pair(-A[i].first, -A[i].second);
  for (i = n; i >= 0; i--) {
    int t = upper_bound(B, B + s, A[i].second) - B;
    if (A[i].first == 0 and A[i].second == 0) {
      cout << t << ' ';
      break;
    }
    if (t == s) s++;
    B[t] = A[i].second;
  }
  sort(C + 1, C + n + 1);
  s = 0;
  for (i = 1; i <= n; i++) {
    int t = upper_bound(B, B + s, C[i].second) - B;
    if (t == s) s++;
    B[t] = C[i].second;
  }
  cout << s << endl;
}
