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, t, a, b;
} s[100005];
long long n, v;
bool cmp(const node &a, const node &b) {
  return a.a == b.a ? a.b < b.b : a.a < b.a;
}
long long que[100005];
long long len, ans1, ans2;
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; ++i) scanf("%lld%lld", &s[i].x, &s[i].t);
  scanf("%lld", &v);
  for (long long i = 1; i <= n; ++i) {
    s[i].a = -s[i].x + s[i].t * v;
    s[i].b = s[i].x + s[i].t * v;
  }
  sort(s + 1, s + n + 1, cmp);
  que[0] = -0x3f3f3f3f3f3f3f3fll;
  que[++len] = 0x3f3f3f3f3f3f3f3fll;
  for (long long i = 1; i <= n; ++i) {
    long long pos = upper_bound(que + 1, que + len + 1, s[i].b) - que;
    if (que[pos] > s[i].b) que[pos] = s[i].b;
    if (pos >= len) que[++len] = 0x3f3f3f3f3f3f3f3fll;
  }
  ans2 = len - 1;
  que[len = 1] = 0x3f3f3f3f3f3f3f3fll;
  for (long long i = 1; i <= n; ++i)
    if (s[i].a >= 0 && s[i].b >= 0) {
      long long pos = upper_bound(que + 1, que + len + 1, s[i].b) - que;
      if (que[pos] > s[i].b) que[pos] = s[i].b;
      if (pos >= len) que[++len] = 0x3f3f3f3f3f3f3f3fll;
    }
  ans1 = len - 1;
  printf("%lld %lld", ans1, ans2);
  return 0;
}
