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 = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, i, x, y, s, v, ans2;
int B[N];
pair<int, int> A[N], C[N];
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d %d", &A[i].first, &A[i].second);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    A[i] =
        make_pair(A[i].second * v - A[i].first, A[i].second * v + A[i].first);
    C[i] = A[i];
  }
  A[0] = make_pair(0, 0);
  sort(A, A + n + 1);
  for (i = 0; i <= n; i++) A[i] = make_pair(-A[i].first, -A[i].second);
  for (i = n; i >= 0; i--) {
    int t = upper_bound(B, B + s, A[i].second) - B;
    if (!i) cout << t << ' ';
    if (t == s) s++;
    B[t] = A[i].second;
  }
  sort(C + 1, C + n + 1);
  s = 0;
  for (i = 1; i <= n; i++) {
    int t = upper_bound(B, B + s, C[i].second) - B;
    if (t == s) s++;
    B[t] = C[i].second;
  }
  cout << s << endl;
}
