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;
enum { MAXN = 100010 };
pair<long long, long long> d[MAXN];
int x[MAXN], t[MAXN];
long long minv[MAXN];
int solveB(int n) {
  int mans = 0;
  for (int i = 0; i < n; i++) {
    int f = upper_bound(minv, minv + mans, d[i].second) - minv + 1;
    if (f > mans) {
      minv[mans] = d[i].second;
      mans = f;
    } else
      minv[f - 1] = min(minv[f - 1], d[i].second);
  }
  return mans;
}
int solveA(int n) {
  int mans = 1;
  minv[0] = 0;
  for (int i = 0; i < n; i++)
    if (d[i].first >= 0) {
      int f = upper_bound(minv, minv + mans, d[i].second) - minv + 1;
      if (f > 1) {
        if (f > mans) {
          minv[mans] = d[i].second;
          mans = f;
        } else
          minv[f - 1] = min(minv[f - 1], d[i].second);
      }
    }
  return mans - 1;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &t[i]);
  int v;
  scanf("%d", &v);
  for (int i = 0; i < n; i++)
    d[i] = make_pair(x[i] + (long long)t[i] * v, -x[i] + (long long)t[i] * v);
  sort(d, d + n);
  int ansA = solveA(n);
  int ansB = solveB(n);
  printf("%d\n%d\n", ansA, ansB);
  return 0;
}
