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;
struct node {
  long long x, y;
} a[100010], b[100010];
long long n, V, cnt, x[100010], t[100010];
multiset<long long> S;
multiset<long long>::iterator it;
inline bool cmp(node x, node y) { return x.x == y.x ? x.y < y.y : x.x < y.x; }
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &t[i]);
  scanf("%lld", &V);
  for (long long i = 1; i <= n; i++) {
    if (V * t[i] + x[i] >= 0 && V * t[i] - x[i] >= 0)
      a[++cnt] = (node){V * t[i] - x[i], V * t[i] + x[i]};
    b[i] = (node){V * t[i] - x[i], V * t[i] + x[i]};
  }
  sort(a + 1, a + cnt + 1, cmp);
  for (long long i = 1; i <= cnt; i++) {
    it = S.upper_bound(a[i].y);
    if (it != S.end()) S.erase(it);
    S.insert(a[i].y);
  }
  printf("%d ", (signed)S.size());
  S.clear();
  sort(b + 1, b + n + 1, cmp);
  for (long long i = 1; i <= n; i++) {
    it = S.upper_bound(b[i].y);
    if (it != S.end()) S.erase(it);
    S.insert(b[i].y);
  }
  printf("%d", (signed)S.size());
  return 0;
}
