12
-6712 6
2375 73
4643 197
-5660 215
-378 223
2228 307
3305 340
3449 468
-4389 707
-7161 729
-1838 921
-1655 985
730
 5
1 5
6 7
17127 17
17072 42
17042 77
3
 7
-976754 20479
79929143 911181
9598220 82517
-51609349 810257
67416551 266544
-14170975 307690
-15476178 491195
352
 22
-5301 602
-1400 194
-8512 987
-282 962
6484 494
9091 523
-7744 92
6002 461
5053 305
-1339 272
-821 165
9308 785
929 421
8384 883
1266 157
8411 923
-2949 885
7725 687
6859 197
-7630 867
5031 918
5662 410
41

11 12
 2 3
 5 5
 9 9

#include <bits/stdc++.h>
using namespace std;
int n;
long long x[100010], t[100010], v, r, bitt[100010];
vector<pair<long long, long long> > p;
vector<long long> hp, hb, hhb;
map<long long, int> eq;
void putt(long long v) {
  int h = eq[v];
  while (h <= hb.size()) {
    bitt[h]++;
    h += (h & (-h));
  }
}
long long gett(long long v) {
  int h = eq[v];
  long long g = 0;
  while (h) {
    g += bitt[h];
    h -= (h & (-h));
  }
  return g;
}
int main() {
  long long tfi = 2e6;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld %lld", &x[i], &t[i]);
  scanf("%lld", &v);
  for (int i = 0; i < n; i++) {
    p.push_back({x[i] - v * (tfi - t[i]), -x[i] - v * (tfi - t[i])});
    hhb.push_back(x[i] + v * (tfi - t[i]));
    if (p.back().first < -tfi * v || -p.back().second > tfi * v) p.pop_back();
  }
  sort(hhb.begin(), hhb.end());
  hb.push_back(hhb[0]);
  for (int i = 1; i < hhb.size(); i++)
    if (hhb[i] != hhb[i - 1]) hb.push_back(hhb[i]);
  for (int i = 0; i < hb.size(); i++) eq[hb[i]] = i + 1;
  sort(p.begin(), p.end());
  for (int i = 0; i < p.size(); i++) hp.push_back(-p[i].second);
  sort(hp.begin(), hp.end());
  for (int i = 0; i < p.size(); i++) {
    long long ub = upper_bound(hp.begin(), hp.end(), -p[i].second) - hp.begin();
    r = max(r, ub - gett(-p[i].second));
    putt(-p[i].second);
  }
  printf("%lld ", r);
  p.clear();
  hp.clear();
  r = 0;
  for (int i = 0; i <= hb.size(); i++) bitt[i] = 0;
  for (int i = 0; i < n; i++)
    p.push_back({x[i] - v * (tfi - t[i]), -x[i] - v * (tfi - t[i])});
  sort(p.begin(), p.end());
  for (int i = 0; i < p.size(); i++) hp.push_back(-p[i].second);
  sort(hp.begin(), hp.end());
  for (int i = 0; i < p.size(); i++) {
    long long ub = upper_bound(hp.begin(), hp.end(), -p[i].second) - hp.begin();
    r = max(r, ub - gett(-p[i].second));
    putt(-p[i].second);
  }
  printf("%lld\n", r);
}
