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;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int n, V, n1;
pair<int, int> p[111111];
int v[222222];
int s[222222];
void setVal(int p, int val) {
  p += 111111;
  while (p) {
    s[p] = max(s[p], val);
    p >>= 1;
  }
}
int getMax(int p) {
  int res = 0;
  p += 111111;
  int end = -1 + 2 * 111111;
  while (p <= end) {
    res = max(res, s[p]);
    res = max(res, s[end]);
    p = (p + 1) >> 1;
    end = (end - 1) >> 1;
  }
  return res;
}
pair<int, int> q[111111];
int main() {
  int t = 1;
  while (t--) {
    cin >> n;
    for (int i(0); i < (n); i++) scanf("%d %d", &p[i].first, &p[i].second);
    cin >> V;
    for (int i(0); i < (n); i++) {
      int p1 = p[i].first - int(V) * p[i].second;
      int p2 = p[i].first + int(V) * p[i].second;
      v[i] = p2;
      q[i] = make_pair(p1, -p2);
    }
    sort(q, q + n);
    for (int i(0); i < (n); i++) q[i].second *= (-1);
    sort(v, v + n);
    n1 = unique(v, v + n) - v;
    int res = 0;
    int vv2 = 0;
    bool checkF = false;
    for (int i(0); i < (n); i++) {
      if (q[i].first > 0 && !checkF) {
        checkF = true;
        vv2 = getMax(lower_bound(v, v + n1, 0) - v);
      }
      int p = lower_bound(v, v + n1, q[i].second) - v;
      int val = getMax(p) + 1;
      setVal(p, val);
      res = max(res, val);
    }
    if (!checkF) vv2 = getMax(lower_bound(v, v + n1, 0) - v);
    cout << vv2 << ' ' << res << endl;
  }
  return 0;
}
