#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const int inf = (-1u) >> 1;
struct event {
  int x, t;
  void input() { scanf("%d%d", &x, &t); }
};
event e[maxn];
pair<long long, long long> vp[maxn];
map<long long, int> mp;
int n, v;
long long getK1(const event& e) { return (long long)v * e.t - e.x; }
long long getK2(const event& e) { return (long long)v * e.t + e.x; }
int solve1() {
  int res = 0;
  mp.clear();
  mp[0] = 0;
  for (int i = 0; i < (n); ++i)
    if (vp[i].first >= 0) {
      long long x = vp[i].second;
      map<long long, int>::iterator it = mp.upper_bound(x);
      if (it == mp.begin()) continue;
      int cur = (--it)->second + 1;
      mp[x] = cur;
      while (true) {
        it = mp.upper_bound(x);
        if (it == mp.end() || it->second > cur) {
          break;
        }
        mp.erase(it);
      }
      res = max(res, cur);
    }
  return res;
}
int solve2() {
  int res = 0;
  mp.clear();
  for (int i = 0; i < (n); ++i) {
    long long x = vp[i].second;
    int cur = 1;
    map<long long, int>::iterator it = mp.upper_bound(x);
    if (it != mp.begin()) {
      cur = (--it)->second + 1;
    }
    mp[x] = cur;
    while (true) {
      it = mp.upper_bound(x);
      if (it == mp.end() || it->second > cur) {
        break;
      }
      mp.erase(it);
    }
    res = max(res, cur);
  }
  return res;
}
void solve() {
  for (int i = 0; i < (n); ++i) {
    vp[i] = pair<long long, long long>(getK1(e[i]), getK2(e[i]));
  }
  sort(vp, vp + n);
  printf("%d %d\n", solve1(), solve2());
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < (n); ++i) {
      e[i].input();
    }
    scanf("%d", &v);
    solve();
  }
  return 0;
}
