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 = 1E5 + 10;
const int INF = ~0U >> 1;
struct data {
  int p, q;
  bool operator<(const data &b) const {
    if (p < b.p) return 1;
    if (p > b.p) return 0;
    return q < b.q;
  }
} a[maxn];
int d[maxn], p[maxn], q[maxn];
int n, v, x[maxn], t[maxn], f[maxn];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d %d", &x[i], &t[i]), d[i] = INF;
  d[0] = -d[1];
  cin >> v;
  for (int i = 1; i <= n; i++)
    a[i].p = x[i] + t[i] * v, a[i].q = -x[i] + t[i] * v;
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    int po = upper_bound(d, d + n + 1, a[i].q) - d;
    f[i] = po;
    d[po] = a[i].q;
  }
  int ans2 = 0;
  for (int i = 1; i <= n; i++) ans2 = max(ans2, f[i]);
  for (int i = 1; i <= n + 1; i++) d[i] = INF;
  d[0] = 0;
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= n; i++) {
    if (a[i].p < 0 || a[i].q < 0) continue;
    int po = upper_bound(d, d + n + 1, a[i].q) - d;
    f[i] = po;
    d[po] = a[i].q;
  }
  int ans1 = 0;
  for (int i = 1; i <= n; i++) ans1 = max(ans1, f[i]);
  printf("%d %d", ans1, ans2);
  return 0;
}
