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;
class Coor {
 public:
  long long x, y;
  Coor() {}
  Coor(long long xi, long long yi) : x(xi), y(yi) {}
  void input() { cin >> x >> y; }
  void print() { cout << x << " " << y << endl; }
  const bool operator<(const Coor &b) const {
    return x > b.x || x == b.x && y > b.y;
  }
};
int n, slp;
Coor p[100050];
int ll;
long long lds[100050];
inline void tran() {
  int i;
  long long tx, ty;
  for (i = 0; i < n; i++) {
    tx = p[i].x;
    ty = p[i].y;
    p[i].x = ty * slp + tx;
    p[i].y = ty * slp - tx;
  }
}
inline int findlds(Coor *p, int n) {
  int i, l, r, m;
  long long y;
  std::sort(p, p + n);
  ll = 0;
  for (i = 0; i < n; i++) {
    y = p[i].y;
    l = -1;
    r = ll;
    while (l < r - 1) {
      m = (l + r) >> 1;
      if (lds[m] < y)
        r = m;
      else
        l = m;
    }
    if (r == ll) ll++;
    lds[r] = y;
  }
  return ll;
}
inline void solve() {
  int i, sol1, sol2;
  tran();
  sol2 = findlds(p, n);
  while (n && p[n - 1].x < 0) n--;
  findlds(p, n);
  int l, r, m;
  long long y;
  y = 0;
  l = -1;
  r = ll;
  while (l < r - 1) {
    m = (l + r) >> 1;
    if (lds[m] < y)
      r = m;
    else
      l = m;
  }
  sol1 = r;
  cout << sol1 << " " << sol2 << endl;
}
int main(void) {
  int i;
  while (cin >> n) {
    for (i = 0; i < n; i++) p[i].input();
    cin >> slp;
    solve();
  }
}
