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;
vector<long long> st;
vector<long long> t;
long long upd(long long v, long long l, long long r, long long L, long long R,
              long long x) {
  if (l >= R || L >= r) return 0;
  if (L <= l && r <= R) {
    t[v] = max(t[v], x);
    return t[v];
  }
  return t[v] = max(upd(v * 2, l, (l + r) / 2, L, R, x),
                    upd(v * 2 + 1, (l + r) / 2, r, L, R, x));
}
long long get(long long v, long long l, long long r, long long L, long long R) {
  if (l >= R || L >= r) return 0;
  if (L <= l && r <= R) return t[v];
  return max(get(v * 2, l, (l + r) / 2, L, R),
             get(v * 2 + 1, (l + r) / 2, r, L, R));
}
long long get_pos(long long x) {
  return lower_bound(st.begin(), st.end(), x) - st.begin();
}
signed main() {
  long long n;
  cin >> n;
  vector<pair<long long, long long>> v(n);
  for (long long i = 0; i < n; ++i) cin >> v[i].first >> v[i].second;
  long long u;
  cin >> u;
  for (long long i = 0; i < n; ++i) {
    long long x = v[i].first, time = v[i].second;
    v[i].first = x - time * u;
    v[i].second = -x - time * u;
    st.push_back(v[i].first);
    st.push_back(v[i].second);
  }
  sort(v.begin(), v.end());
  sort(st.begin(), st.end());
  st.erase(unique(st.begin(), st.end()), st.end());
  long long N = st.size() + 1;
  t.resize(4 * N);
  long long ans_1 = 0, ans_2 = 0;
  for (long long i = 0; i < n; ++i) {
    long long x = get(1, 0, N, 0, get_pos(v[i].second) + 1) + 1;
    if (v[i].first <= 0) {
      ans_1 = max(ans_1, x);
    }
    upd(1, 0, N, get_pos(v[i].second), get_pos(v[i].second) + 1, x);
    ans_2 = max(ans_2, x);
  }
  cout << ans_1 << " " << ans_2;
}
