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;
deque<int> dq;
long long ans1, ans2, v, n, tot, dp[maxn];
struct thi {
  long long x;
  long long t;
  long long valx;
  long long valy;
  friend bool operator<(thi cp1, thi cp2) {
    return (cp1.valx ^ cp2.valx) ? cp1.valx < cp2.valx : cp1.valy < cp2.valy;
  }
} sz[maxn], cz[maxn];
inline long long LIS(long long jsq) {
  multiset<long long> st;
  multiset<long long>::iterator it;
  for (register int i = 1; i <= jsq; i++) {
    it = st.upper_bound(sz[i].valy);
    if (it != st.end()) st.erase(it);
    st.insert(sz[i].valy);
  }
  return st.size();
}
inline long long LIS2(long long jsq) {
  multiset<long long> st;
  multiset<long long>::iterator it;
  for (register int i = 1; i <= jsq; i++) {
    it = st.upper_bound(cz[i].valy);
    if (it != st.end()) st.erase(it);
    st.insert(cz[i].valy);
  }
  return st.size();
}
int main() {
  scanf("%lld", &n);
  for (register int i = 1; i <= n; i++) {
    scanf("%lld%lld", &sz[i].x, &sz[i].t);
  }
  scanf("%lld", &v);
  for (register int i = 1; i <= n; i++)
    sz[i].valx = v * sz[i].t - sz[i].x, sz[i].valy = v * sz[i].t + sz[i].x;
  sort(sz + 1, sz + n + 1);
  ans2 = LIS(n);
  for (register int i = 1; i <= n; i++) {
    if (sz[i].valx >= 0 && sz[i].valy >= 0) {
      cz[++tot].valx = sz[i].valx;
      cz[tot].valy = sz[i].valy;
    }
  }
  ans1 = LIS2(tot);
  printf("%lld %lld", ans1, ans2);
  return 0;
}
