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;
int n, v, cnt, now1, now2, ans1, ans2;
int p[100010], t[100010], s1[100010], s2[100010];
long long b[100010];
pair<long long, long long> a[100010];
map<long long, int> mp;
inline void change(int *s, int x, int w) {
  for (; x <= cnt; x += ((x) & (-x))) s[x] = max(s[x], w);
}
inline int query(int *s, int x) {
  int t = 0;
  for (; x; x -= ((x) & (-x))) t = max(t, s[x]);
  return t;
}
int main() {
  int i, j;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d%d", p + i, t + i);
  scanf("%d", &v);
  for (i = 1; i <= n; i++) {
    a[i].first = (long long)p[i] - (long long)v * t[i];
    a[i].second = (long long)(-v) * t[i] - p[i];
    b[i] = -a[i].second;
  }
  sort(a + 1, a + 1 + n);
  sort(b + 1, b + 1 + n);
  b[0] = -1e18;
  for (i = 1; i <= n; i++)
    if (b[i] != b[i - 1]) mp[b[i]] = ++cnt;
  for (i = n; i; i--) {
    if (a[i].first <= 0 && a[i].second <= 0)
      now1 = 1;
    else
      now1 = 0;
    now1 += query(s1, mp[-a[i].second]);
    ans1 = max(ans1, now1);
    change(s1, mp[-a[i].second], now1);
    now2 = 1;
    now2 += query(s2, mp[-a[i].second]);
    ans2 = max(ans2, now2);
    change(s2, mp[-a[i].second], now2);
  }
  printf("%d %d\n", ans1, ans2);
  return 0;
}
