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 p, q;
  int id;
};
int n, v, len, ans1, ans2;
int x[100010], t[100010];
long long que[100010];
node event[100010];
bool cmp(const node &a, const node &b) {
  return a.p < b.p || (a.p == b.p && a.q < b.q);
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%d%d", x + i, t + i);
    scanf("%d", &v);
    for (int i = 0; i < n; i++) {
      event[i].p = (long long)x[i] + (long long)t[i] * v;
      event[i].q = -(long long)x[i] + (long long)t[i] * v;
      event[i].id = 0;
    }
    event[n].p = 0;
    event[n].q = 0;
    event[n].id = -1;
    n++;
    sort(event, event + n, cmp);
    len = 0;
    que[0] = -(long long)2000000000 * 2000000000;
    ans1 = ans2 = 0;
    for (int i = n - 1; i >= 0; i--) {
      long long x = -event[i].q;
      if (x > que[len] || len == 0) {
        que[++len] = x;
        if (event[i].id == -1)
          ans1 = max(ans1, len - 1);
        else
          ans2 = max(ans2, len);
      } else {
        int pos = upper_bound(que + 1, que + len + 1, x) - que;
        que[pos] = x;
        if (event[i].id == -1)
          ans1 = max(ans1, pos - 1);
        else
          ans2 = max(ans2, pos);
      }
    }
    printf("%d %d\n", ans1, ans2);
  }
  return 0;
}
