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 n;
int x[Maxn], t[Maxn];
int v;
long double ang, sn, cs;
pair<long double, long double> c[Maxn];
vector<long double> seq;
int getRes1() {
  seq.clear();
  for (int i = 0; i < n; i++)
    if (c[i].first >= 0.0l && c[i].second >= 0.0l) {
      int ind = upper_bound(seq.begin(), seq.end(), c[i].second) - seq.begin();
      if (ind < seq.size())
        seq[ind] = c[i].second;
      else
        seq.push_back(c[i].second);
    }
  return seq.size();
}
int getRes2() {
  seq.clear();
  for (int i = 0; i < n; i++) {
    int ind = upper_bound(seq.begin(), seq.end(), c[i].second) - seq.begin();
    if (ind < seq.size())
      seq[ind] = c[i].second;
    else
      seq.push_back(c[i].second);
  }
  return seq.size();
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d %d", &x[i], &t[i]);
  scanf("%d", &v);
  ang = atan(1.0l / long double(v));
  sn = sin(ang), cs = cos(ang);
  for (int i = 0; i < n; i++)
    c[i] = pair<long double, long double>(x[i] * sn + t[i] * cs,
                                          -x[i] * sn + t[i] * cs);
  sort(c, c + n);
  printf("%d %d\n", getRes1(), getRes2());
  return 0;
}
