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;
long long a[100005], b[100005], r[100005], p[100005], t[100005];
int c[100005], sa[100005], f[100005], n, m, v;
bool cmp(int i, int j) { return b[i] > b[j] || (b[i] == b[j] && t[i] > t[j]); }
int ask(int x) {
  int s = 0;
  for (; x; x -= x & (-x)) s = max(s, c[x]);
  return s;
}
void updata(int x, int d) {
  for (; x <= m; x += x & (-x)) c[x] = max(c[x], d);
}
void work() {
  int a1 = 0, a2 = 0;
  for (int i = 1; i <= n; i++) sa[i] = i;
  sort(sa + 1, sa + 1 + n, cmp);
  for (int j = 1; j <= n; j++) {
    int i = sa[j], k;
    k = lower_bound(r + 1, r + 1 + m, a[i]) - r;
    f[i] = ask(k) + 1;
    updata(k, f[i]);
    a2 = max(a2, f[i]);
  }
  for (int i = 1; i <= n; i++)
    if (t[i] * v >= abs(p[i])) a1 = max(a1, f[i]);
  printf("%d %d\n", a1, a2);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%I64d%I64d", p + i, t + i);
  scanf("%d", &v);
  for (int i = 1; i <= n; i++) {
    a[i] = p[i] - t[i] * v;
    b[i] = p[i] + t[i] * v;
    r[++m] = a[i];
  }
  sort(r + 1, r + 1 + m);
  m = unique(r + 1, r + 1 + m) - r - 1;
  work();
  return 0;
}
