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;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int x[100009], t[100009];
int calc(vector<pair<int, int> > ans) {
  vector<int> s;
  sort(ans.begin(), ans.end());
  for (int i = 0; i < int(ans.size()); i++) {
    if (s.size() == 0 or s.back() <= ans[i].second)
      s.push_back(ans[i].second);
    else
      *upper_bound(s.begin(), s.end(), ans[i].second) = ans[i].second;
  }
  return int(s.size());
}
int main() {
  int n, V;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &V);
  vector<pair<int, int> > nol, pos;
  for (int i = 1; i <= n; i++) {
    int xx = -x[i] + t[i] * V;
    int yy = +x[i] + t[i] * V;
    if (xx >= 0 and yy >= 0) nol.push_back(make_pair(xx, yy));
    pos.push_back(make_pair(xx, yy));
  }
  printf("%d %d\n", calc(nol), calc(pos));
  return 0;
}
