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 main() {
  int n, Vi;
  cin >> n;
  vector<pair<long long, long long> > v(n);
  vector<long long> x(n), t(n), b;
  for (int i = 0; i < n; i++) {
    scanf("%I64d %I64d", &x[i], &t[i]);
  }
  cin >> Vi;
  for (int i = 0; i < n; i++) {
    v[i] = make_pair(-x[i] + t[i] * Vi, x[i] + t[i] * Vi);
  }
  sort(v.rbegin(), v.rend());
  int ret0 = 0;
  for (int i = 0; i < n; i++) {
    int pos =
        upper_bound(b.begin(), b.end(), v[i].second, greater<long long>()) -
        b.begin();
    if (pos == b.size()) {
      b.push_back(v[i].second);
    } else if (v[i].second > b[pos]) {
      b[pos] = v[i].second;
    }
    if (i == n - 1) {
      ret0 = pos;
    }
  }
  printf("%d %d\n", ret0, (int)b.size());
  return 0;
}
