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;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
const int N = 1e5 + 7;
int x[N], t[N];
vector<pair<int, int> > a;
int32_t main() {
  int n = in();
  for (int i = 0; i < n; i++) x[i] = in(), t[i] = in();
  int s = in();
  for (int i = 0; i < n; i++) a.push_back({x[i] + t[i] * s, t[i] * s - x[i]});
  sort(a.begin(), a.end());
  vector<int> lis;
  for (int i = 0; i < n; i++) {
    long pos = lower_bound(lis.begin(), lis.end(), a[i].second) - lis.begin();
    if (pos == ((int)lis.size())) lis.push_back(a[i].second);
    lis[pos] = a[i].second;
  }
  cout << ((int)lis.size()) << ' ';
  reverse(a.begin(), a.end());
  while (a.back().first < 0) a.pop_back();
  a.push_back({0, 0});
  reverse(a.begin(), a.end());
  lis.clear();
  for (int i = 0; i < n; i++) {
    long pos = lower_bound(lis.begin(), lis.end(), a[i].second) - lis.begin();
    if (pos == ((int)lis.size())) lis.push_back(a[i].second);
    if (pos) lis[pos] = a[i].second;
  }
  cout << ((int)lis.size()) - 1 << '\n';
}
