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;
const int maxn = 1e5 + 100;
pair<int, int> p[maxn];
vector<pair<int, int> > num;
vector<int> vec, ves;
int x[maxn], t[maxn];
int main() {
  int n, m, f, g, v;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> t[i];
  cin >> v;
  for (int i = 0; i < n; i++) {
    p[i].first = x[i] + v * t[i];
    p[i].second = v * t[i] - x[i];
    if (p[i].first >= 0 && p[i].second >= 0)
      num.push_back(make_pair(p[i].first, p[i].second));
  }
  sort(p, p + n);
  for (int i = 0; i < n; i++) {
    int it = upper_bound(vec.begin(), vec.end(), p[i].second) - vec.begin();
    if (it == vec.size())
      vec.push_back(p[i].second);
    else
      vec[it] = p[i].second;
  }
  num.push_back(make_pair(0, 0));
  sort(num.begin(), num.end());
  for (int i = 0; i < num.size(); i++) {
    int it = upper_bound(ves.begin(), ves.end(), num[i].second) - ves.begin();
    if (it == ves.size())
      ves.push_back(num[i].second);
    else
      ves[it] = num[i].second;
  }
  cout << ves.size() - 1 << "  " << vec.size();
}
