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;
int ans, all, n, i, j, k, f[100011], dl[100011], x[100011], t[100011],
    tree[100011];
long long v, q[100011], p[100011], w[100011];
bool cmp(int a, int b) {
  if (p[a] < p[b]) return true;
  if (p[a] > p[b]) return false;
  if (q[a] < q[b]) return true;
  return false;
}
int lowbit(int x) { return x - (x & (x - 1)); }
int qmax(int x) {
  int ans = -(1 << 30);
  while (x) {
    ans = max(ans, tree[x]);
    x -= lowbit(x);
  }
  return ans;
}
void insert(int w, int x) {
  while (x <= all) {
    tree[x] = max(tree[x], w);
    x += lowbit(x);
  }
}
int convert(long long x) {
  int s = 1, e = all, mid;
  while (s != e) {
    mid = (s + e) / 2;
    if (w[mid] < x)
      s = mid + 1;
    else
      e = mid;
  }
  return s;
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &v);
  for (i = 1; i <= n; i++)
    dl[i] = i, p[i] = v * t[i] - x[i], w[i] = q[i] = v * t[i] + x[i];
  sort(dl + 1, dl + n + 1, cmp);
  sort(w + 1, w + n + 1);
  for (i = 1, all = 0; i <= n;) {
    w[++all] = w[i];
    while (i <= n + 1 && w[i] == w[all]) i++;
  }
  for (i = 1; i <= n; i++) q[i] = convert(q[i]);
  for (i = 1; i <= all; i++) tree[i] = -(1 << 30);
  ans = 1;
  for (i = 1; i <= n; i++)
    if (dl[i] != 1) {
      f[dl[i]] = qmax(q[dl[i]]) + 1;
      ans = max(ans, f[dl[i]]);
      insert(f[dl[i]], q[dl[i]]);
    } else
      insert(1, q[dl[i]]);
  printf("%d ", ans);
  for (i = 1; i <= all; i++) tree[i] = 0;
  ans = 1;
  for (i = 1; i <= n; i++) {
    f[dl[i]] = qmax(q[dl[i]]) + 1;
    ans = max(ans, f[dl[i]]);
    insert(f[dl[i]], q[dl[i]]);
  }
  printf("%d\n", ans);
  return 0;
}
