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 N = 1000 * 100 + 10;
const long long INF = 1000 * 1000 * 1000ll * 1000 * 1000ll * 1000;
long long v;
int n;
pair<long long, long long> ary[N], a[N];
long long data[N];
int bs(int x) {
  int f = 0, l = n + 1;
  while (l - f > 1) {
    int mid = (f + l) / 2;
    if (data[mid] <= x)
      f = mid;
    else
      l = mid;
  }
  return f;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    ary[i].first = v * a[i].second + a[i].first;
    ary[i].second = v * a[i].second - a[i].first;
  }
  sort(ary, ary + n);
  fill(data, data + n + 1, INF);
  data[0] = 0;
  for (int i = 0; i < n; i++) {
    int x = bs(ary[i].second);
    data[x + 1] = min(data[x + 1], ary[i].second);
  }
  int ans = 0;
  for (int i = n; i >= 0 && ans == 0; i--) {
    if (data[i] != INF) ans = i;
  }
  cout << ans << " ";
  fill(data, data + n + 1, INF);
  data[0] = 0;
  for (int i = 0; i < n; i++) {
    if (ary[i].first < 0 || ary[i].second < 0) continue;
    int x = bs(ary[i].second);
    data[x + 1] = min(data[x + 1], ary[i].second);
  }
  ans = 0;
  for (int i = n; i >= 0 && ans == 0; i--) {
    if (data[i] != INF) ans = i;
  }
  cout << ans << endl;
  return 0;
}
