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, v;
vector<pair<int, int> > a;
vector<int> f, g;
bool check(int i, int j) {
  if (a[i].first == a[j].first) return a[i] == a[j];
  return (abs(a[i].second - a[j].second) * 1.0 / (a[i].first - a[j].first) <=
          v);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  a.assign(n, pair<int, int>());
  ;
  for (int i = 0; i < (int)n; ++i) cin >> a[i].second >> a[i].first;
  cin >> v;
  sort(a.begin(), a.end());
  f.assign(n, 0);
  ;
  g.assign(n, 1);
  ;
  f[0] = (a[0].second * 1.0 / a[0].first <= v);
  for (int i = 1; i < (int)n; ++i) {
    f[i] = (a[i].second * 1.0 / a[i].first <= v);
    for (int j = 0; j < (int)i; ++j)
      if (check(i, j)) f[i] = max(f[i], f[j] + 1);
    for (int j = 0; j < (int)i; ++j)
      if (check(i, j)) g[i] = max(g[i], g[j] + 1);
  }
  cout << *max_element(f.begin(), f.end()) << ' '
       << *max_element(g.begin(), g.end()) << endl;
}
