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 N = 1e5 + 1;
int n, cnt, tot;
long long v;
struct incident {
  long long x, t;
} a[N];
struct mapping {
  long long k1, k2;
} m[N], p[N];
multiset<long long> s;
multiset<long long>::iterator it;
inline int rint() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
inline long long rll() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
inline bool cmp(mapping a, mapping b) {
  if (a.k1 == b.k1) return a.k2 < b.k2;
  return a.k1 < b.k1;
}
int main() {
  n = rint();
  for (register int i = 1; i <= n; i++) a[i] = (incident){rll(), rll()};
  v = rll();
  for (register int i = 1; i <= n; i++) {
    m[i] = (mapping){v * a[i].t - a[i].x, v * a[i].t + a[i].x};
    if (m[i].k1 >= 0 && m[i].k2 >= 0) p[++tot] = m[i];
  }
  sort(m + 1, m + n + 1, cmp);
  sort(p + 1, p + tot + 1, cmp);
  for (register int i = 1; i <= tot; i++) {
    it = s.upper_bound(p[i].k2);
    if (it != s.end()) s.erase(it);
    s.insert(p[i].k2);
  }
  printf("%d ", s.size());
  s.clear();
  for (register int i = 1; i <= n; i++) {
    it = s.upper_bound(m[i].k2);
    if (it != s.end()) s.erase(it);
    s.insert(m[i].k2);
  }
  printf("%d", s.size());
  return 0;
}
