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 = 100 * 1000;
int x[maxn], t[maxn];
int V;
pair<int, int> a[maxn];
int N;
int LIS(bool flag) {
  vector<int> v;
  for (int i = 0; i < N; ++i) {
    if (flag || (0 <= a[i].first && 0 <= a[i].second)) {
      int p = upper_bound(v.begin(), v.end(), a[i].second) - v.begin();
      if (p == (int)v.size())
        v.push_back(a[i].second);
      else
        v[p] = a[i].second;
    }
  }
  return v.size();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> x[i] >> t[i];
  cin >> V;
  for (int i = 0; i < N; ++i) {
    a[i] = pair<int, int>(V * t[i] - x[i], x[i] + V * t[i]);
  }
  sort(a, a + N);
  cout << LIS(0) << " " << LIS(1) << endl;
  return 0;
}
