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 int maxn = 201000;
struct Point {
  long long x, y;
  bool operator<(Point a) const {
    if (x != a.x) return x < a.x;
    return y < a.y;
  }
} p[maxn];
int x[maxn], t[maxn];
int LIS(int n) {
  multiset<long long> st;
  multiset<long long>::iterator it;
  for (int i = 0; i < n; i++) {
    it = st.upper_bound(p[i].y);
    if (it != st.end()) st.erase(it);
    st.insert(p[i].y);
  }
  return st.size();
}
int main() {
  int n;
  long long V;
  while (scanf("%d", &n) == 1) {
    for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &t[i]);
    scanf("%I64d", &V);
    int tot = 0;
    for (int i = 0; i < n; i++)
      if (V * t[i] + x[i] >= 0 && V * t[i] - x[i] >= 0) {
        p[tot].x = V * t[i] + x[i];
        p[tot++].y = V * t[i] - x[i];
      }
    sort(p, p + tot);
    int ans1 = LIS(tot);
    for (int i = 0; i < n; i++) {
      p[i].x = V * t[i] + x[i];
      p[i].y = V * t[i] - x[i];
    }
    sort(p, p + n);
    int ans2 = LIS(n);
    printf("%d %d\n", ans1, ans2);
  }
  return 0;
}
