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