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 long long N = 100100;
vector<pair<long long, long long> > a1, a2;
long long x[N], y[N];
map<long long, long long> fen;
long long get(long long v) {
  long long ans = 0;
  for (long long i = v; i > 0; i -= i & -i) ans += fen[i];
  return ans;
}
void add(long long v) {
  for (int i = v; i < N; i += i & -i) fen[i]++;
}
long long lis(vector<pair<long long, long long> > v) {
  long long ans = 0;
  sort(v.begin(), v.end());
  for (int i = 0; i < N; i++) fen[i] = 0;
  for (int i = 0; i < v.size(); i++)
    ans = max(ans, get(v[i].second) + 1), add(v[i].second);
  return ans;
}
int main() {
  long long n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  long long v;
  cin >> v;
  for (int i = 0; i < n; i++) {
    int a = v * y[i], b = x[i];
    a -= b;
    b *= 2;
    b += a;
    a1.push_back({a, b});
    a2.push_back({a, b});
    if (a < 0 || b < 0) a1.pop_back();
  }
  cout << lis(a1) << " " << lis(a2) << endl;
  return 0;
}
