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;
int n, v, f[100003];
pair<int, int> a[100003];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &a[i].first, &a[i].second);
  scanf("%d", &v);
  for (int i = 1; i <= n; ++i) {
    pair<int, int> t = a[i];
    a[i].first = v * t.second - t.first;
    a[i].second = v * t.second + t.first;
  }
  ++n, a[n].first = a[n].second = 0;
  sort(a + 1, a + n + 1);
  int cnt = 1, l, r;
  f[0] = 2000000000;
  for (int i = n; i; --i) {
    for (l = 0, r = cnt; l < r;)
      if (f[l + r >> 1] >= a[i].second)
        l = (l + r >> 1) + 1;
      else
        r = l + r >> 1;
    if (a[i].first || a[i].second) {
      f[l] = a[i].second;
      if (l == cnt) ++cnt;
    } else
      printf("%d ", l - 1);
  }
  printf("%d\n", cnt - 1);
  return 0;
}
