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>
long long l, r, x, n, i, j, h, k, t, d, m, v, c[200005];
using namespace std;
pair<int, int> a[200005];
bool cmp(pair<int, int> a, pair<int, int> b) {
  if ((a.second * v - a.first < b.second * v - b.first) ||
      (a.second * v - a.first == b.second * v - b.first &&
       a.second * v + a.first < b.second * v + b.first))
    return 1;
  else
    return 0;
}
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
  cin >> v;
  n++;
  sort(a + 1, a + n + 1, cmp);
  for (i = n; i >= 1; i--) {
    x = a[i].second * v + a[i].first;
    l = d + 1;
    if (d == 0 || x <= c[d])
      d++;
    else {
      l = 1;
      r = d;
      while (l <= r) {
        t = (l + r) / 2;
        if (x <= c[t])
          l = t + 1;
        else
          r = t - 1;
      }
      c[l] = x;
    }
    if (a[i].second == 0 && a[i].first == 0)
      cout << l - 1 << ' ';
    else
      m = max(m, d);
  }
  cout << m;
}
