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 = 100000;
int n, V;
int p[MAXN + 10], t[MAXN + 10];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); i++) scanf("%d%d", &p[i], &t[i]);
  scanf("%d", &V);
  vector<pair<long long, long long> > v;
  for (int i = 0; i < (n); i++)
    v.push_back(
        make_pair(t[i] * (long long)V - p[i], t[i] * (long long)V + p[i]));
  sort(v.begin(), v.end());
  vector<long long> vv;
  for (__typeof(v.begin()) i = v.begin(); i != v.end(); ++i)
    if (vv.empty() || vv.back() <= i->second)
      vv.push_back(i->second);
    else
      *upper_bound(vv.begin(), vv.end(), i->second) = i->second;
  int ans2 = vv.size();
  vv.clear();
  for (__typeof(v.begin()) i = v.begin(); i != v.end(); ++i)
    if (i->first >= 0 && i->second >= 0)
      if (vv.empty() || vv.back() <= i->second)
        vv.push_back(i->second);
      else
        *upper_bound(vv.begin(), vv.end(), i->second) = i->second;
  int ans1 = vv.size();
  printf("%d %d\n", ans1, ans2);
  return 0;
}
