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>
int n, v;
struct Node {
  int t, x;
  long long p, q;
  bool operator<(const Node& a) const {
    if (p == a.p) return q < a.q;
    return p < a.p;
  }
} node[105000];
using namespace std;
int dp[105000];
long long length[105000];
int root;
void DP() {
  sort(node + 1, node + 1 + n);
  root = 1;
  for (int i = n; i > 0; i--) {
    int left = 0;
    length[0] = 90000000000;
    int right = root - 1;
    while (left <= right) {
      int mid = (left + right) >> 1;
      if (length[mid] >= node[i].q)
        left = mid + 1;
      else
        right = mid - 1;
    }
    dp[i] = left;
    if (left == root) root++;
    length[left] = node[i].q;
  }
  int p = 0;
  int q = 0;
  int sum = 0;
  for (int i = 1; i < n + 1; i++) {
    if (p <= node[i].p && q <= node[i].q) {
      sum = (dp[i] > sum ? dp[i] : sum);
    }
  }
  cout << sum << ' ' << root - 1 << endl;
}
int main() {
  while (cin >> n) {
    for (int i = 1; i < n + 1; i++) scanf("%d%d", &node[i].x, &node[i].t);
    cin >> v;
    for (int i = 1; i < n + 1; i++) {
      node[i].p = node[i].t * v + node[i].x;
      node[i].q = node[i].p - 2 * node[i].x;
    }
    DP();
  }
  return 0;
}
