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 MOD = 95542721;
const int INF = 2e9;
const long long INF64 = 2e18;
const long double EPS = 1e-16;
const long long MD = 1551513443;
const long long T = 2543;
const int N = 200011;
const int M = 23;
const int DEBUG = 0;
const int MAGIC = 320;
int n, V, first[N], t[N], d[N], dp[N];
pair<int, int> a[N];
int main() {
  cin >> n;
  for (int i = 0; i < int(n); i++) scanf("%d %d", &first[i], &t[i]);
  cin >> V;
  for (int i = 0; i < int(n); i++) {
    a[i].first = first[i] + t[i] * V;
    a[i].second = -first[i] + t[i] * V;
  }
  sort(a, a + n);
  reverse(a, a + n);
  fill(dp, dp + N, -INF);
  dp[0] = INF;
  int ans = 0, ans0 = 0;
  for (int i = 0; i < int(n); i++) {
    int l = 0, r = n;
    while (r - l > 1) {
      int m = (l + r) / 2;
      if (dp[m] >= a[i].second)
        l = m;
      else
        r = m;
    }
    ans = max(ans, l + 1);
    dp[l + 1] = a[i].second;
    d[i] = l + 1;
  }
  for (int i = 0; i < int(n); i++)
    if (a[i].first >= 0 && a[i].second >= 0) ans0 = max(ans0, d[i]);
  cout << ans0 << ' ' << ans << endl;
  return 0;
}
