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;
struct event {
  long long x, t;
};
struct point {
  long long f, g;
};
long long n, v;
event e[100001];
point fg[100001];
bool cmp(const event& a, const event& b) { return a.t < b.t; }
bool cmp2(const point& a, const point& b) {
  if (a.f == b.f)
    return a.g < b.g;
  else
    return a.f < b.f;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> e[i].x >> e[i].t;
  sort(e, e + n, cmp);
  cin >> v;
  for (long long i = 0; i < n; i++) {
    fg[i].f = -e[i].x + e[i].t * v;
    fg[i].g = e[i].x + e[i].t * v;
  }
  sort(fg, fg + n, cmp2);
  vector<long long> v1;
  for (long long i = 0; i < n; i++) {
    if (!v1.size() || fg[i].g >= v1[v1.size() - 1]) {
      v1.push_back(fg[i].g);
    } else {
      long long pos = lower_bound(v1.begin(), v1.end(), fg[i].g) - v1.begin();
      v1[pos] = fg[i].g;
    }
  }
  long long secondans = v1.size();
  v1.clear();
  for (long long i = 0; i < n; i++) {
    if (fg[i].f < 0 || fg[i].g < 0) continue;
    if (!v1.size() || fg[i].g >= v1[v1.size() - 1]) {
      v1.push_back(fg[i].g);
    } else {
      long long pos = lower_bound(v1.begin(), v1.end(), fg[i].g) - v1.begin();
      v1[pos] = fg[i].g;
    }
  }
  cout << v1.size() << " " << secondans;
}
