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, sh, sh2, f, l, m;
long long x[100001], t[100001], v, save[100001], n_s = -1, ans[100001];
pair<pair<long long, long long>, int> P[100001];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d %I64d", &x[i], &t[i]);
  scanf("%I64d", &v);
  for (int i = 0; i < n; i++)
    P[i] = make_pair(make_pair(t[i] * v + x[i], v * t[i] - x[i]), i);
  sort(P, P + n);
  sh = 0;
  sh2 = -1;
  for (int i = n - 1; i >= 0; i--) {
    f = 0, l = n_s;
    while (f <= l) {
      m = (f + l) / 2;
      if (save[m] >= P[i].first.second)
        f = m + 1;
      else
        l = m - 1;
    }
    l++;
    if (l > n_s) n_s = l;
    sh = max(sh, l);
    if (abs(x[P[i].second]) <= v * t[P[i].second]) sh2 = max(sh2, l);
    save[l] = P[i].first.second;
  }
  printf("%d %d\n", sh2 + 1, sh + 1);
  return 0;
}
