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 st {
  int a, b;
  bool operator<(const st& B) const { return a < B.a || (a == B.a && b < B.b); }
} a[100005];
int N, V, b[100005];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d%d", &a[i].a, &a[i].b);
  scanf("%d", &V), N++;
  for (int i = 1, x, t; i <= N; i++)
    x = a[i].a, t = a[i].b, a[i].a = V * t + x, a[i].b = V * t - x;
  sort(a + 1, a + N + 1);
  int ans = 0;
  memset(b, 63, sizeof(b));
  for (int i = N, j; i; i--) {
    j = upper_bound(b + 1, b + N + 1, -a[i].b) - b, b[j] = -a[i].b;
    if (!a[i].a && !a[i].b)
      printf("%d ", j - 1);
    else
      ans = max(ans, j);
  }
  printf("%d\n", ans);
}
