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;
pair<int, int> arr[200000];
vector<int> lis;
vector<int>::iterator it;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  int x, t, v;
  for (long long int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second;
  cin >> v;
  for (long long int i = 1; i <= n; i++) {
    x = arr[i].first;
    t = arr[i].second;
    arr[i] = make_pair(t * v + x, t * v - x);
  }
  sort(arr + 1, arr + n + 1);
  lis.clear();
  lis.push_back(0);
  for (long long int i = 1; i <= n; i++) {
    if (arr[i].second < 0) continue;
    it = upper_bound(lis.begin(), lis.end(), arr[i].second);
    if (it == lis.end())
      lis.push_back(arr[i].second);
    else
      *it = arr[i].second;
  }
  cout << lis.size() - 1 << " ";
  lis.clear();
  for (long long int i = 1; i <= n; i++) {
    it = upper_bound(lis.begin(), lis.end(), arr[i].second);
    if (it == lis.end())
      lis.push_back(arr[i].second);
    else
      *it = arr[i].second;
  }
  cout << lis.size() << endl;
}
