#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 100005;
pair<long long, long long> a[maxn];
long long dp[maxn];
int n, x[maxn], t[maxn], v;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &v);
  for (int i = 1; i <= n; i++) {
    a[i].first = -x[i] + (long long)t[i] * v;
    a[i].second = x[i] + (long long)t[i] * v;
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) dp[i] = INF;
  dp[0] = -INF;
  int l1 = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].second >= dp[l1])
      dp[++l1] = a[i].second;
    else
      dp[upper_bound(dp, dp + n + 1, a[i].second) - dp] = a[i].second;
  for (int i = 1; i <= n; i++) dp[i] = INF;
  dp[0] = -INF;
  int l2 = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].first >= 0 && a[i].second >= 0) {
      if (a[i].second >= dp[l2])
        dp[++l2] = a[i].second;
      else
        dp[upper_bound(dp, dp + n + 1, a[i].second) - dp] = a[i].second;
    }
  printf("%d %d\n", l2, l1);
  return 0;
}
