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;
const int N = 250005;
const long long inf = 1LL << 60;
int n;
long long x[N], y[N], v, b[N];
pair<long long, long long> a[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    y[i] *= v;
  }
  for (int i = 0; i < n; i++) {
    a[i] = make_pair(x[i] + y[i], y[i] - x[i]);
  }
  a[n++] = make_pair(0, 0);
  sort(a, a + n);
  fill(b, b + n, inf);
  for (int i = 0; i < n; i++) {
    *upper_bound(b, b + n, a[i].second) = a[i].second;
  }
  printf("%d\n", lower_bound(b, b + n, inf) - b - 1);
  n--;
  for (int i = 0; i < n; i++) {
    a[i] = make_pair(x[i] + y[i], y[i] - x[i]);
  }
  sort(a, a + n);
  fill(b, b + n, inf);
  for (int i = 0; i < n; i++) {
    *upper_bound(b, b + n, a[i].second) = a[i].second;
  }
  printf("%d\n", lower_bound(b, b + n, inf) - b);
  return 0;
}
