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 N = 1e5 + 10, inf = 0x3f3f3f3f;
struct Event {
  int p;
  int q;
  int id;
  bool operator<(const Event &x) const { return p == x.p ? q < x.q : p < x.p; }
};
Event a[N], b[N];
int n, v, qwq, ans, c[N], tree[N], dp[N];
void update(int x, int k) {
  for (; x <= qwq; x += (x & (-x))) tree[x] = max(tree[x], k);
}
int query(int x) {
  int ans = 0;
  for (; x >= 1; x -= (x & (-x))) ans = max(ans, tree[x]);
  return ans;
}
int main() {
  scanf("%d", &n);
  for (int i = (1), iend = (n); i <= iend; i++) scanf("%d%d", &a[i].p, &a[i].q);
  scanf("%d", &v);
  for (int i = (1), iend = (n); i <= iend; i++) {
    b[i] = (Event){-v * a[i].q + a[i].p, -v * a[i].q - a[i].p, i};
    c[i] = b[i].q;
  }
  sort(c + 1, c + 2 + n);
  qwq = unique(c + 1, c + 2 + n) - c - 1;
  for (int i = (1), iend = (n + 1); i <= iend; i++)
    b[i].q = lower_bound(c + 1, c + 1 + qwq, b[i].q) - c;
  sort(b + 1, b + 2 + n);
  for (int i = (1), iend = (n + 1); i <= iend; i++) {
    dp[i] = query(b[i].q) + 1;
    update(b[i].q, dp[i]);
    if (a[b[i].id].q == 0) {
      printf("%d ", dp[i] - 1);
      break;
    }
  }
  memset(tree, 0, sizeof(tree));
  for (int i = (1), iend = (n + 1); i <= iend; i++) {
    if (a[b[i].id].q != 0) {
      dp[i] = query(b[i].q) + 1;
      ans = max(ans, dp[i]);
      update(b[i].q, dp[i]);
    }
  }
  printf("%d", ans);
  return 0;
}
