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, Ans1, Ans2;
struct Node {
  int p, q;
  bool operator<(Node o) const { return p < o.p || (p == o.p && q < o.q); }
} s[102012];
vector<int> S;
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) {
    scanf("%d %d", &s[i].p, &s[i].q);
  }
  scanf("%d", &V);
  for (int i = 1; i <= N; ++i) {
    int x = -s[i].p + V * s[i].q, y = s[i].p + V * s[i].q;
    s[i].p = x;
    s[i].q = y;
  }
  sort(s + 1, s + N + 1);
  S.push_back(s[1].q);
  S.push_back(2000000000);
  for (int i = 2; i <= N; ++i) {
    vector<int>::iterator o = upper_bound(S.begin(), S.end(), s[i].q);
    if (*o == 2000000000) {
      *o = s[i].q;
      S.push_back(2000000000);
    } else {
      *o = s[i].q;
    }
  }
  Ans2 = S.size() - 1;
  S.erase(S.begin(), S.end());
  S.push_back(0);
  S.push_back(2000000000);
  for (int i = 1; i <= N; ++i)
    if (s[i].p >= 0 && s[i].q >= 0) {
      vector<int>::iterator o = upper_bound(S.begin(), S.end(), s[i].q);
      if (*o == 2000000000) {
        *o = s[i].q;
        S.push_back(2000000000);
      } else {
        *o = s[i].q;
      }
    }
  Ans1 = S.size() - 2;
  cout << Ans1 << ' ' << Ans2 << endl;
  return 0;
}
