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 = 100 * 1000;
int n, v, first, x[maxn], t[maxn], d[maxn];
long long val[maxn];
bool mark[maxn];
struct event {
  long long p, q;
} e[maxn];
bool operator<(event a, event b) {
  if (a.q == b.q) return a.p > b.p;
  return a.q < b.q;
}
void read();
int LIS();
int f(int m);
int main() {
  read();
  int ans2 = LIS();
  bool ff = false;
  for (int i = 0; i < n; i++) {
    mark[i] = f(x[i]) > (long long)v * t[i];
    if (!mark[i] && !ff) {
      ff = true;
      first = i;
    }
  }
  int ans1 = LIS();
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
void read() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> t[i];
  cin >> v;
  for (int i = 0; i < n; i++)
    e[i].p = x[i] + (long long)v * t[i], e[i].q = e[i].p - 2 * x[i];
  sort(e, e + n);
}
int LIS() {
  d[0] = first;
  val[0] = e[first].p;
  int last = 1;
  for (int i = first + 1; i < n; i++) {
    if (mark[i]) continue;
    int ind = upper_bound(val, val + last, e[i].p) - val;
    d[ind] = i;
    val[ind] = e[i].p;
    if (ind == last) last++;
  }
  return last;
}
int f(int m) {
  if (m >= 0) return m;
  return m * (-1);
}
