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;
struct INC {
  int x, y;
  bool operator<(const INC &a) const {
    return (x < a.x) || (x == a.x && y < a.y);
  }
} A[100100];
int f[200100], n, i, j, Vel, maxx, K;
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d%d", &A[i].x, &A[i].y);
  scanf("%d", &Vel);
  n++;
  for (i = 1; i <= n; i++) {
    A[i].y = A[i].y * Vel - A[i].x;
    A[i].x = A[i].x * 2 + A[i].y;
  }
  sort(A + 1, A + n + 1);
  for (i = n; i > 0; i--) {
    K = upper_bound(f + 1, f + maxx + 1, -A[i].y) - f;
    if (A[i].x == 0 && A[i].y == 0) {
      printf("%d ", K - 1);
      continue;
    }
    f[K] = -A[i].y;
    if (K > maxx) maxx = K;
  }
  printf("%d\n", maxx);
  return 0;
}
