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;
pair<int, int> a[111111];
int x[111111], t[111111], b[111111], f[111111];
int ans1, ans2;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &t[i]);
  cin >> V;
  for (int i = 1; i <= n; ++i)
    t[i] *= V, a[i] = make_pair(t[i] - x[i], t[i] + x[i]);
  sort(a + 1, a + 1 + n);
  b[0] = -2000000000;
  for (int i = 1; i <= n; ++i) b[i] = 2000000000;
  for (int i = 1; i <= n; ++i) {
    f[i] = lower_bound(b, b + 1 + n, a[i].second + 1) - b;
    b[f[i]] = min(b[f[i]], a[i].second);
    ans2 = max(ans2, f[i]);
  }
  int fd = 0;
  for (int i = 1; i <= n; ++i)
    if (a[i].first == 0 && a[i].second == 0) fd = i;
  if (!fd) a[++n] = make_pair(0, 0);
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; ++i)
    if (a[i].first == 0 && a[i].second == 0) fd = i;
  for (int i = 0; i <= n; ++i) b[i] = 2000000000;
  b[(ans1 = f[fd] = 0)] = a[fd].second;
  for (int i = fd + 1; i <= n; ++i) {
    if (a[i].second >= 0) {
      f[i] = lower_bound(b, b + 1 + n, a[i].second + 1) - b;
      b[f[i]] = min(b[f[i]], a[i].second);
      ans1 = max(ans1, f[i]);
    }
  }
  printf("%d %d\n", ans1, ans2);
}
