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;
pair<long long, long long> eve[100010];
int n, v;
int seq[100010], l;
int x[100010], t[100010];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", x + i, t + i);
  scanf("%d", &v);
  for (int i = 1; i <= n; i++)
    eve[i] = make_pair(1LL * t[i] * v - x[i], 1LL * t[i] * v + x[i]);
  sort(eve + 1, eve + n + 1);
  l = 0;
  for (int i = 1; i <= n; i++) {
    if (eve[i].first < 0 || eve[i].second < 0) continue;
    if (!l || seq[l] <= eve[i].second)
      seq[++l] = eve[i].second;
    else
      seq[upper_bound(seq + 1, seq + l + 1, eve[i].second) - seq] =
          eve[i].second;
  }
  printf("%d ", l);
  l = 0;
  for (int i = 1; i <= n; i++) {
    if (!l || seq[l] <= eve[i].second)
      seq[++l] = eve[i].second;
    else
      seq[upper_bound(seq + 1, seq + l + 1, eve[i].second) - seq] =
          eve[i].second;
  }
  printf("%d", l);
  return 0;
}
