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;
struct point {
  int x, t, p, q;
};
bool operator>(point a, point b) {
  return (a.p > b.p) or (a.p == b.p and a.q > b.q);
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  point arr[n + 1];
  for (int i = 0; i < n; i++) cin >> arr[i].x >> arr[i].t;
  int v;
  cin >> v;
  for (int i = 0; i < n; i++)
    arr[i].p = arr[i].x + arr[i].t * v, arr[i].q = -arr[i].x + arr[i].t * v;
  arr[n].p = arr[n].q = arr[n].x = arr[n].t = 0;
  sort(arr, arr + n + 1, greater<point>());
  int d[n + 1];
  for (int i = 0; i <= n; i++) d[i] = (int)1e9;
  int cur_len = 1;
  for (int i = 0; i <= n; i++) {
    int ind = upper_bound(d, d + cur_len, -arr[i].q) - d;
    if (arr[i].t == 0 and arr[i].x == 0)
      cout << ind << " ";
    else {
      d[ind] = -arr[i].q;
      cur_len = max(ind + 1, cur_len);
    }
  }
  cout << cur_len << "\n";
}
