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 long long maxn = 1e5 + 10;
typedef struct aa {
  long long a, b;
  bool operator<(const aa& o) const { return a < o.a || (a == o.a && b < o.b); }
} per;
per si[maxn];
long long n, x[maxn], t[maxn], v, z[maxn], cur, ans1, ans2;
long long find_pos(long long num) {
  long long l = 1, r = cur;
  while (l < r) {
    long long mid = (l + r) / 2;
    if (si[z[mid]].b > num)
      r = mid;
    else
      l = mid + 1;
  }
  return r;
}
signed main() {
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    scanf("%lld%lld", &x[i], &t[i]);
  }
  cin >> v;
  for (long long i = 1; i <= n; ++i) {
    si[i].a = x[i] + v * t[i];
    si[i].b = -x[i] + v * t[i];
  }
  sort(si + 1, si + 1 + n);
  for (long long i = 1; i <= n; ++i) {
    if (cur == 0 || (si[i].b >= si[z[cur]].b))
      z[++cur] = i;
    else {
      long long temp = find_pos(si[i].b);
      z[temp] = i;
    }
  }
  ans2 = cur;
  cur = 0;
  for (long long i = 1; i <= n; ++i) {
    if (si[i].a < 0 || si[i].b < 0) continue;
    if (cur == 0 || (si[i].b >= si[z[cur]].b))
      z[++cur] = i;
    else {
      long long temp = find_pos(si[i].b);
      z[temp] = i;
    }
  }
  ans1 = cur;
  cout << ans1 << ' ' << ans2;
  return 0;
}
