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>
int n, V, w, x[100005], y[100005], p[100005], a[100005];
bool b[100005];
bool cmpx(const int i, const int j) {
  return x[i] == x[j] ? y[i] < y[j] : x[i] < x[j];
}
bool cmpy(const int i, const int j) {
  return y[i] == y[j] ? x[i] < x[j] : y[i] < y[j];
}
int get(int x) {
  int res = 0;
  for (; x; x -= x & -x) res = res > a[x] ? res : a[x];
  return res;
}
void modify(int x, int v) {
  for (; x <= n; x += x & -x) a[x] = a[x] > v ? a[x] : v;
}
int work(bool flag) {
  for (int k = 0; k < n; k++) {
    int i = p[k], f = get(y[i]) + 1;
    if (flag + b[i] + f == 1) f = 0;
    modify(y[i], f);
  }
  int f = get(n);
  memset(a, 0, sizeof(a));
  return f;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]), p[i] = i;
  scanf("%d", &V);
  for (int i = 0; i < n; i++)
    w = x[i], x[i] = y[i] * V - w, y[i] = y[i] * V + w,
    b[i] = x[i] >= 0 && y[i] >= 0;
  std::sort(p, p + n, cmpy);
  for (int i = 0; i < n; i++) y[p[i]] = i + 1;
  std::sort(p, p + n, cmpx);
  printf("%d %d\n", work(0), work(1));
  return 0;
}
