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, v;
pair<long long, long long> a[100005];
int d1[100005], d2[100005];
struct seg {
  int tree[105000];
  void init() { fill(tree, tree + 105000, -1e9); }
  void add(int x, int v) {
    while (x <= n + 5) {
      tree[x] = max(tree[x], v);
      x += x & -x;
    }
  }
  int query(int x) {
    int ret = -1e9;
    while (x) {
      ret = max(ret, tree[x]);
      x -= x & -x;
    }
    return ret;
  }
} seg1, seg2;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%lld %lld", &a[i].first, &a[i].second);
  }
  cin >> v;
  vector<long long> vy;
  vy.push_back(-1e18);
  for (int i = 0; i <= n; i++) {
    a[i] = pair<long long, long long>(v * a[i].second - a[i].first,
                                      v * a[i].second + a[i].first);
    vy.push_back(a[i].second);
  }
  sort(vy.begin(), vy.end());
  vy.resize(unique(vy.begin(), vy.end()) - vy.begin());
  sort(a + 1, a + n + 1);
  for (int i = 0; i <= n; i++) {
    a[i].second = lower_bound(vy.begin(), vy.end(), a[i].second) - vy.begin();
  }
  seg1.init();
  seg2.init();
  seg1.add(a[0].second, 0);
  int r1 = 0, r2 = 0;
  for (int i = 1; i <= n; i++) {
    d1[i] = -1e9;
    if (a[i].first >= 0) d1[i] = seg1.query(a[i].second) + 1;
    d2[i] = max(0, seg2.query(a[i].second)) + 1;
    seg1.add(a[i].second, d1[i]);
    seg2.add(a[i].second, d2[i]);
    r1 = max(r1, d1[i]);
    r2 = max(r2, d2[i]);
  }
  cout << r1 << " " << r2;
}
