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;
struct st {
  long long x, y;
  bool operator<(const st& s) const {
    return (x < s.x || (x == s.x && y < s.y));
  }
} a[100001];
int i, n, fi, an;
long long x[100001], y[100001], f[100001], v;
int erfen(int l, int r, int xx) {
  if (l == r) return l;
  int mi = (l + r + 1) / 2;
  if (f[mi] <= xx)
    return (erfen(mi, r, xx));
  else
    return (erfen(l, mi - 1, xx));
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%I64d%I64d", &x[i], &y[i]);
  scanf("%I64d", &v);
  for (i = 1; i <= n; i++) a[i].x = -x[i] + y[i] * v, a[i].y = x[i] + y[i] * v;
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; i++) f[i] = 1e9, f[i] = f[i] * f[i];
  for (i = 1; i <= n; i++)
    if (a[i].x >= 0 && a[i].y >= 0) {
      fi = erfen(0, an, a[i].y);
      if (a[i].y < f[fi + 1]) f[fi + 1] = a[i].y;
      if (fi == an) an++;
    }
  printf("%d ", an);
  an = 0;
  for (i = 1; i <= n; i++) f[i] = 1e9, f[i] = f[i] * f[i];
  for (i = 1; i <= n; i++) {
    fi = erfen(0, an, a[i].y);
    if (a[i].y < f[fi + 1]) f[fi + 1] = a[i].y;
    if (fi == an) an++;
  }
  printf("%d\n", an);
}
