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 = 1000010;
int n, xx[maxn], yy[maxn], cnt;
long long c[maxn], now[maxn], v;
struct da {
  long long x, y;
} po[maxn];
bool cmp(da aa, da bb) {
  if (aa.x == bb.x) return aa.y < bb.y;
  return aa.x < bb.x;
}
int LIS(long long *d, int nn) {
  memset(c, 0, sizeof(c));
  c[1] = d[1];
  int l, r, mid, len = 1;
  for (int i = 2; i <= nn; i++) {
    l = 1;
    r = len;
    while (l <= r) {
      mid = (l + r) / 2;
      if (c[mid] < d[i])
        l = mid + 1;
      else
        r = mid - 1;
    }
    c[l] = d[i];
    if (l > len) len++;
  }
  return len;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &xx[i], &yy[i]);
  scanf("%lld", &v);
  for (int i = 1; i <= n; i++)
    po[i].x = v * yy[i] + xx[i], po[i].y = v * yy[i] - xx[i];
  sort(po + 1, po + n + 1, cmp);
  for (int i = 1; i <= n; i++)
    if (po[i].x >= 0 && po[i].y >= 0) now[++cnt] = po[i].y;
  printf("%d ", LIS(now, cnt));
  cnt = 0;
  for (int i = 1; i <= n; i++) now[++cnt] = po[i].y;
  printf("%d\n", LIS(now, cnt));
  return 0;
}
