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 INF = 0x3f3f3f3f;
struct node {
  int x, y;
};
bool cmp(node a, node b) {
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
node s[100005];
int p[100005], q[100005], dp[100005];
int main() {
  int n, i, j, v, ans1, ans2;
  while (scanf("%d", &n) != EOF) {
    for (i = 0; i < n; i++) scanf("%d%d", &p[i], &q[i]);
    scanf("%d", &v);
    for (i = 0; i < n; i++) {
      s[i].x = -1 * p[i] + q[i] * v;
      s[i].y = p[i] + q[i] * v;
    }
    sort(s, s + n, cmp);
    fill(dp, dp + n, INF);
    for (i = 0; i < n; i++) *upper_bound(dp, dp + n, s[i].y) = s[i].y;
    ans1 = lower_bound(dp, dp + n, INF) - dp;
    fill(dp, dp + n, INF);
    for (j = 0; j < n; j++)
      if (s[j].x >= 0 && s[j].y >= 0) break;
    for (i = j; i < n; i++) *upper_bound(dp, dp + n, s[i].y) = s[i].y;
    ans2 = lower_bound(dp, dp + n, INF) - dp;
    printf("%d %d\n", ans2, ans1);
  }
  return 0;
}
