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 MAXN = 100005;
int n, x[MAXN], t[MAXN];
struct EVENT {
  int x, y;
} a[MAXN];
int v;
int dp[MAXN];
inline bool cmp(const EVENT &a, const EVENT &b) {
  return a.x < b.x || a.x == b.x && a.y < b.y;
}
int mi[MAXN];
void work() {
  memset(mi, 120, sizeof(mi));
  for (int i = 1; i <= n; i++) {
    int l = -1, r = i;
    while (l < r) {
      int mid = (l + r + 1) >> 1;
      if (mi[mid] <= a[i].y)
        l = mid;
      else
        r = mid - 1;
    }
    if (l != -1) dp[i] = max(dp[i], l + 1);
    if (dp[i] >= 0 && mi[dp[i]] > a[i].y) mi[dp[i]] = a[i].y;
  }
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (dp[i] > ans) ans = dp[i];
  printf("%d", ans);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &v);
  for (int i = 1; i <= n; i++)
    a[i].x = x[i] + v * t[i], a[i].y = -x[i] + v * t[i];
  n++;
  a[n].x = a[n].y = 0;
  sort(a + 1, a + n + 1, cmp);
  memset(dp, -20, sizeof(dp));
  for (int i = 1; i <= n; i++)
    if (a[i].x == a[i].y && a[i].x == 0) dp[i] = 0;
  work();
  printf(" ");
  for (int i = 1; i <= n; i++) dp[i] = 1;
  for (int i = 1; i <= n; i++)
    if (a[i].x == a[i].y && a[i].x == 0) {
      for (int j = i; j < n; j++) a[j] = a[j + 1];
      n--;
      break;
    }
  work();
  printf("\n");
  return 0;
}
