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 long long linf = 1e18 + 5;
const int mod = (int)1e9 + 7;
const int logN = 18;
const int inf = 1e9;
const int N = 100002;
int n, V, x[N], y[N], S[N];
vector<pair<int, int> > v1, v2;
int solve(vector<pair<int, int> > &v) {
  int l = 0;
  for (__typeof(v.begin()) it = v.begin(); it != v.end(); it++) {
    int index = lower_bound(S, S + l, it->second) - S;
    if (l == index) l++;
    S[index] = it->second;
  }
  return l;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d %d", &x[i], &y[i]);
  scanf("%d", &V);
  for (int i = 1; i <= n; i++) {
    int xx = -x[i] + V * y[i];
    int yy = +x[i] + V * y[i];
    if (xx >= 0 && yy >= 0) v1.push_back(make_pair(xx, yy));
    v2.push_back(make_pair(xx, yy));
  }
  printf("%d %d\n", solve(v1), solve(v2));
  return 0;
}
