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 _pow(int a, int b, int mo) {
  int tmp = 1;
  a %= mo;
  for (; b; b >>= 1) {
    if (b & 1) tmp = (long long)tmp * a % mo;
    a = (long long)a * a % mo;
  }
  return tmp;
}
template <class T>
inline void R(T &xx) {
  xx = 0;
  char ch = getchar();
  bool F = 0;
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') F = 1, ch = getchar();
  while (ch >= '0' && ch <= '9')
    xx = xx + xx + (xx << 3) + ch - 48, ch = getchar();
  if (F) xx = -xx;
}
int n, v, mx;
long long c[100011];
pair<long long, long long> a[100011];
int main() {
  R(n);
  for (int i = 0; i < (int)n; i++) R(a[i].first), R(a[i].second);
  R(v);
  for (int i = 0; i < (int)n; i++)
    a[i] =
        make_pair(-a[i].first + a[i].second * v, a[i].first + a[i].second * v);
  a[n] = make_pair(0, 0);
  sort(a, a + n + 1);
  for (int i = n; i >= 0; i--) {
    int j = upper_bound(c + 1, c + mx + 1, -a[i].second) - c;
    if (a[i] == make_pair(0ll, 0ll))
      printf("%d ", j - 1);
    else
      c[j] = -a[i].second, mx = max(mx, j);
  }
  printf("%d\n", mx);
  return 0;
}
