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 maxn = 1000 * 100 + 100;
long long q[maxn], b[maxn], c[maxn];
struct point {
  long long id, l;
  bool operator<(const point &B) const {
    if (l == B.l) {
      return q[id] < q[B.id];
    } else
      return l < B.l;
  }
};
point p[maxn];
pair<long long, long long> a[maxn];
long long LIS(long long b[], long long tmp, long long c[]) {
  long long size = 1;
  c[0] = b[0];
  for (long long i = 1; i < tmp; i++) {
    long long x = upper_bound(c, c + size, b[i]) - c;
    c[x] = b[i];
    if (x == size) size++;
  }
  return size;
}
int main() {
  long long n, v;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  cin >> v;
  for (long long i = 0; i < n; i++) {
    p[i].id = i, p[i].l = -(a[i].first) + (v * a[i].second);
    q[i] = (a[i].first) + (v * a[i].second);
  }
  sort(p, p + n);
  long long tmp = 0;
  for (long long i = 0; i < n; i++) {
    if (p[i].l >= 0 && q[p[i].id] >= 0) b[tmp++] = q[p[i].id];
  }
  cout << LIS(b, tmp, c) << " ";
  for (long long i = 0; i < n; i++) {
    b[i] = q[p[i].id];
  }
  cout << LIS(b, n, c) << endl;
  return 0;
}
