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 long long inf = INT_MAX, df = 2e5 + 7;
long long i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, tim[df],
    dis[df], que[df << 2], ans1, ans2;
struct node {
  long long num, sum;
} a[df];
bool cmp(node st, node ch) {
  return (st.num == ch.num) ? st.sum < ch.sum : st.num < ch.num;
}
inline long long read() {
  long long x = 0, y = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') y = (ch == '-') ? -1 : 1, ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return x * y;
}
inline long long check(long long l, long long r, long long x) {
  long long ans = 0, mid = 0;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (que[mid] > x)
      ans = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  return ans;
}
int main() {
  n = read();
  for (long long i = (1); i <= (n); ++i) dis[i] = read(), tim[i] = read();
  v = read();
  for (long long i = (1); i <= (n); ++i)
    a[i].num = v * tim[i] - dis[i], a[i].sum = v * tim[i] + dis[i];
  sort(a + 1, a + n + 1, cmp);
  que[0] = -inf, que[r = 1] = inf;
  for (long long i = (1); i <= (n); ++i) {
    long long x = check(0, r, a[i].sum);
    if (que[x] > a[i].sum) que[x] = a[i].sum;
    if (x >= r) que[++r] = inf;
  }
  ans2 = r - 1;
  que[r = 1] = inf;
  for (long long i = (1); i <= (n); ++i) {
    if (a[i].sum >= 0 && a[i].num >= 0) {
      long long x = check(0, r, a[i].sum);
      if (que[x] > a[i].sum) que[x] = a[i].sum;
      if (x >= r) que[++r] = inf;
    }
  }
  ans1 = r - 1;
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
