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 = 1000 * 100 + 2;
const long long inf = 1000 * 1000ll * 1000 * 10;
long long n, v, d[maxn], t[maxn], am[maxn];
pair<long long, long long> a[maxn];
int LIS(int start, bool help) {
  int L = 0;
  fill(am, am + n, inf);
  for (int i = start; i < n; i++) {
    if (help && a[i].second < 0) continue;
    int j = upper_bound(am + 1, am + L + 1, a[i].second) - am;
    if (j != -1) j--;
    if (L == j || a[i].second < am[j + 1]) {
      am[j + 1] = a[i].second;
      L = max(L, j + 1);
    }
  }
  return L;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> d[i] >> t[i];
  cin >> v;
  int st = n;
  for (int i = 0; i < n; i++)
    a[i] = make_pair(v * t[i] - d[i], v * t[i] + d[i]);
  sort(a, a + n);
  for (int i = 0; i < n; i++)
    if (a[i].first >= 0) {
      st = i;
      break;
    }
  cout << LIS(st, 1) << " " << LIS(0, 0) << endl;
  return 0;
}
