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>
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
const int N = 200002;
int x[N], t[N], p[N], v;
long long dp1[N], dp2[N];
long long val(int i) { return 1LL * v * t[i] - x[i]; }
long long v4l(int i) { return val(i) + x[i] + x[i]; }
bool cmp(int i, int j) {
  return v4l(i) != v4l(j) ? v4l(i) < v4l(j) : val(i) < val(j);
}
int main() {
  int n = in();
  for (int i = 0; i < n; i++) {
    x[i] = in();
    t[i] = in();
    p[i] = i;
  }
  v = in();
  sort(p, p + n, cmp);
  fill(dp1, dp1 + N, 1e14);
  fill(dp2, dp2 + N, 1e14);
  int ans1 = 0, ans2 = 0;
  for (int _i = 0; _i < n; _i++) {
    int i = p[_i];
    int j2 = upper_bound(dp2, dp2 + n + 1, val(i)) - dp2;
    dp2[j2] = val(i);
    ans2 = max(ans2, j2);
    if (val(i) < 0) continue;
    int j1 = upper_bound(dp1, dp1 + n + 1, val(i)) - dp1;
    dp1[j1] = val(i);
    ans1 = max(ans1, j1);
  }
  cout << 1 + ans1 << " " << ans2 + 1 << endl;
}
