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;
long long n, m, k, l, i, j, a, b, V;
pair<long long, long long> p[100005];
vector<long long> v;
vector<pair<long long, long long> > v1;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
  }
  sort(p, p + n);
  cin >> V;
  for (i = 0; i < n; i++) {
    v1.push_back({p[i].first + p[i].second * V, -p[i].first + p[i].second * V});
  }
  sort(v1.begin(), v1.end());
  for (i = 0; i < n; i++) {
    vector<long long>::iterator a =
        upper_bound(v.begin(), v.end(), v1[i].second);
    if (a == v.end())
      v.push_back(v1[i].second);
    else
      *a = v1[i].second;
  }
  long long res = v.size();
  v.clear();
  v1.push_back({0, 0});
  sort(v1.begin(), v1.end());
  for (i = 0; i < n + 1; i++) {
    if (v1[i].second < 0 || v1[i].first < 0) continue;
    vector<long long>::iterator a =
        upper_bound(v.begin(), v.end(), v1[i].second);
    if (a == v.end())
      v.push_back(v1[i].second);
    else
      *a = v1[i].second;
  }
  cout << v.size() - 1 << " " << res;
}
