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 = 100000000LL * 100000000LL;
const int MAX_N = 100000 + 20;
long long first[MAX_N], t[MAX_N];
pair<long long, long long> f[MAX_N];
long long dp[MAX_N];
int ans[2];
int n, v;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i(0); i < int(n); i++) cin >> first[i] >> t[i];
  cin >> v;
  for (int i(0); i < int(n); i++)
    f[i] = make_pair(-first[i] + v * t[i], first[i] + v * t[i]);
  sort(f, f + n);
  dp[0] = -INF;
  fill(dp + 1, dp + n + 1, INF);
  for (int i(0); i < int(n); i++) {
    int pos = upper_bound(dp, dp + n + 1, f[i].second) - dp;
    dp[pos] = min(dp[pos], f[i].second);
  }
  for (int i(n); i >= int(0); i--)
    if (dp[i] != INF) ans[1] = max(ans[1], i);
  fill(dp + 1, dp + n + 1, INF);
  for (int i(0); i < int(n); i++)
    if (f[i].first > 0 && f[i].second > 0) {
      int pos = upper_bound(dp, dp + n + 1, f[i].second) - dp;
      dp[pos] = min(dp[pos], f[i].second);
    }
  for (int i(n); i >= int(0); i--)
    if (dp[i] != INF) ans[0] = max(ans[0], i);
  cout << ans[0] << ' ' << ans[1] << endl;
  return 0;
}
