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 = 100005;
int t[maxn], x[maxn];
int LIS(vector<pair<int, int> > vec) {
  vector<int> seq;
  for (int i = 0; i < vec.size(); i++) {
    int val = vec[i].second;
    int pos = upper_bound(seq.begin(), seq.end(), val) - seq.begin();
    if (pos >= seq.size())
      seq.push_back(val);
    else
      seq[pos] = val;
  }
  return seq.size();
}
int main() {
  int n, v;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d %d", &x[i], &t[i]);
  scanf("%d", &v);
  vector<pair<int, int> > v1, v2;
  for (int i = 0; i < n; i++) {
    int p = -x[i] + t[i] * v;
    int q = x[i] + t[i] * v;
    v1.push_back({p, q});
    if (p >= 0 && q >= 0) v2.push_back({p, q});
  }
  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end());
  printf("%d %d", LIS(v2), LIS(v1));
}
