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 = 100100;
const int INF = 2147483647;
int N, V;
vector<pair<int, int> > A, B;
int longest_increasing_subsequence(vector<pair<int, int> > &A,
                                   bool second_case = false) {
  int dp[MAXN];
  for (int i = 1; i <= N; i++) dp[i] = INF;
  dp[0] = -INF;
  for (int i = 0; i < A.size(); i++) {
    int j = int(upper_bound(dp, dp + N + 1, A[i].second) - dp);
    if (second_case && (A[i].first < 0 || A[i].second < 0)) continue;
    if (dp[j - 1] <= A[i].second && A[i].second <= dp[j]) dp[j] = A[i].second;
  }
  int q = 0;
  for (int i = 0; i <= N; i++)
    if (dp[i] != INF) q = i;
  return q;
}
int main() {
  cin >> N;
  A.resize(N);
  B.resize(N);
  for (int i = 0; i < N; i++) cin >> A[i].first >> A[i].second;
  cin >> V;
  for (int i = 0; i < N; i++)
    B[i].first = -A[i].first + A[i].second * V,
    B[i].second = A[i].first + A[i].second * V;
  sort(B.begin(), B.end());
  int ans1 = longest_increasing_subsequence(B);
  int ans2 = longest_increasing_subsequence(B, 1);
  cout << ans2 << " " << ans1 << endl;
  return 0;
}
