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, dp1[100000], dp2[100000];
pair<int, int> A[100000];
bool used[100000];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &A[i].second, &A[i].first);
  scanf("%d", &v);
  sort(A, A + n + 1);
  for (int i = 0; i <= n; i++) {
    if (i == 0) dp2[i] = 1;
    if (A[i].first == A[i].second && A[i].first == 0)
      used[i] = true;
    else {
      if (i != 0) dp2[i] = dp2[i - 1];
      dp1[i] = dp1[i - 1];
      for (int j = 0; j < i; j++)
        if (abs(A[i].second - A[j].second) <= v * (A[i].first - A[j].first)) {
          if (j != 0) dp2[i] = max(dp2[i], dp2[j] + 1);
          if (used[j]) dp1[i] = max(dp1[i], dp1[j] + 1), used[i] = true;
        }
    }
  }
  printf("%d %d", dp1[n], dp2[n]);
  return 0;
}
