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 x[100005], t[100005], n, v;
struct Point {
  int x, y;
  bool operator<(Point q) const {
    if (x != q.x) return x < q.x;
    return y < q.y;
  }
  Point() {}
  Point(int X, int Y) { x = X, y = Y; }
} event[100005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> x[i] >> t[i];
  cin >> v;
  int tot = 0;
  for (int i = 1; i <= n; ++i)
    if (v * t[i] + x[i] >= 0 && v * t[i] - x[i] >= 0)
      event[++tot] = Point(v * t[i] + x[i], v * t[i] - x[i]);
  sort(event + 1, event + 1 + tot);
  multiset<int> S;
  multiset<int>::iterator Sit;
  for (int i = 1; i <= tot; ++i) {
    Sit = S.upper_bound(event[i].y);
    if (Sit != S.end()) S.erase(Sit);
    S.insert(event[i].y);
  }
  cout << S.size() << ' ';
  S.clear();
  for (int i = 1; i <= n; ++i)
    event[i] = Point(v * t[i] + x[i], v * t[i] - x[i]);
  sort(event + 1, event + 1 + n);
  for (int i = 1; i <= n; ++i) {
    Sit = S.upper_bound(event[i].y);
    if (Sit != S.end()) S.erase(Sit);
    S.insert(event[i].y);
  }
  cout << S.size() << endl;
  return 0;
}
