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 aaa {
  int x, y;
} a[200001];
int n, i, v, t, k, ans1, ans2, f[200001];
bool cmp(aaa a, aaa b) { return a.x < b.x; }
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d%d", &a[i].x, &a[i].y);
  }
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    t = a[i].x;
    k = a[i].y;
    a[i].x = -t + v * k;
    a[i].y = t + v * k;
  }
  sort(a + 1, a + n + 1, cmp);
  for (i = 1; i <= n; i++) f[i] = 1e9;
  f[0] = -1e9;
  for (i = 1; i <= n; i++) {
    if (a[i].y >= f[ans1])
      f[++ans1] = a[i].y;
    else
      f[upper_bound(f, f + n + 1, a[i].y) - f] = a[i].y;
  }
  for (i = 0; i <= n; i++) f[i] = 1e9;
  f[0] = -1e9;
  for (i = 1; i <= n; i++) {
    if (a[i].x >= 0 && a[i].y >= 0) {
      if (a[i].y >= f[ans2])
        f[++ans2] = a[i].y;
      else
        f[upper_bound(f, f + n + 1, a[i].y) - f] = a[i].y;
    }
  }
  printf("%d %d", ans2, ans1);
}
