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;
int n;
long long V;
pair<int, int> a[110000];
pair<long long, long long> b[110000];
int c[110000];
int solve(int Opt) {
  for (int i = (1); i <= (n); i++)
    b[i] =
        make_pair(V * a[i].second - a[i].first, V * a[i].second + a[i].first);
  sort(b + 1, b + n + 1);
  int len = 0;
  for (int i = (1); i <= (n); i++) {
    int l = 0, r = len;
    while (l < r) {
      int mid = (l + r) / 2 + 1;
      if (c[mid] <= b[i].second)
        l = mid;
      else
        r = mid - 1;
    }
    if (l == 0) {
      if (Opt == 1 && b[i] == make_pair(0LL, 0LL) || Opt == 2) {
        c[l + 1] = b[i].second;
        if (l == len) len++;
      }
    } else {
      c[l + 1] = b[i].second;
      if (l == len) len++;
    }
  }
  return len;
}
int main() {
  cin >> n;
  for (int i = (1); i <= (n); i++) scanf("%d%d", &a[i].first, &a[i].second);
  cin >> V;
  a[++n] = make_pair(0, 0);
  cout << solve(1) - 1 << " ";
  --n;
  cout << solve(2) << endl;
  return 0;
}
