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;
int x[100010], t[100010];
vector<pair<long long, long long> > v;
map<long long, int> mp;
int func1(void) {
  int i, ans = 0;
  mp.clear();
  mp[0] = 0;
  for ((i) = 0; (i) < (int)(N); (i)++)
    if (v[i].first >= 0) {
      long long x = v[i].second;
      if (mp.upper_bound(x) == mp.begin()) continue;
      int tmp = ((--mp.upper_bound(x))->second) + 1;
      mp[x] = tmp;
      while (1) {
        __typeof(mp.begin()) itr = mp.upper_bound(x);
        if (itr == mp.end() || (itr->second) > tmp) break;
        mp.erase(itr);
      }
      ans = max(ans, tmp);
    }
  return ans;
}
int func2(void) {
  int i, ans = 0;
  mp.clear();
  for ((i) = 0; (i) < (int)(N); (i)++) {
    long long x = v[i].second;
    int tmp = 1;
    if (mp.upper_bound(x) != mp.begin())
      tmp = ((--mp.upper_bound(x))->second) + 1;
    mp[x] = tmp;
    while (1) {
      __typeof(mp.begin()) itr = mp.upper_bound(x);
      if (itr == mp.end() || (itr->second) > tmp) break;
      mp.erase(itr);
    }
    ans = max(ans, tmp);
  }
  return ans;
}
int main(void) {
  int V, i;
  scanf("%d", &N);
  for ((i) = 0; (i) < (int)(N); (i)++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &V);
  for ((i) = 0; (i) < (int)(N); (i)++)
    v.push_back(
        make_pair(x[i] + (long long)V * t[i], -x[i] + (long long)V * t[i]));
  sort(v.begin(), v.end());
  int ans1 = func1(), ans2 = func2();
  printf("%d %d\n", ans1, ans2);
  return 0;
}
