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 = 1000000009;
int x[100005], t[100005], l[100005];
pair<int, int> z[100005];
int main() {
  int n, V;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &V);
  for (int i = 0; i < n; ++i) {
    z[i].first = x[i] + V * t[i];
    z[i].second = -x[i] + V * t[i];
  }
  sort(z, z + n);
  fill(l, l + n + 1, inf);
  l[0] = 0;
  for (int i = 0; i < n; ++i) {
    int t = lower_bound(l, l + n + 1, z[i].second) - l;
    if (t) l[t] = z[i].second;
  }
  for (int i = n; i >= 0; --i)
    if (l[i] != inf) {
      printf("%d ", i);
      break;
    }
  fill(l, l + n + 1, inf);
  l[0] = -inf;
  for (int i = 0; i < n; ++i) {
    int t = lower_bound(l, l + n + 1, z[i].second) - l;
    if (t) l[t] = z[i].second;
  }
  for (int i = n; i >= 0; --i)
    if (l[i] != inf) {
      printf("%d ", i);
      break;
    }
  return 0;
}
