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> > Q;
vector<pair<long long, long long> > E;
vector<long long> D;
vector<long long>::iterator it;
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    int x, t;
    scanf("%d%d", &x, &t);
    Q.push_back(make_pair(x, t));
  }
  scanf("%d", &V);
  for (int i = 0; i < N; i++) {
    int x = Q[i].first, t = Q[i].second;
    E.push_back(make_pair(1LL * t * V + x, 1LL * t * V - x));
  }
  sort(E.begin(), E.end());
  int ans1, ans2;
  D.clear();
  for (int i = 0; i < N; i++)
    if (E[i].first >= 0 && E[i].second >= 0) {
      it = upper_bound(D.begin(), D.end(), E[i].second);
      if (it == D.end())
        D.push_back(E[i].second);
      else
        *it = E[i].second;
    }
  ans1 = D.size();
  D.clear();
  for (int i = 0; i < N; i++) {
    it = upper_bound(D.begin(), D.end(), E[i].second);
    if (it == D.end())
      D.push_back(E[i].second);
    else
      *it = E[i].second;
  }
  ans2 = D.size();
  printf("%d %d\n", ans1, ans2);
  return 0;
}
