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;
template <typename Tp>
void setmax(Tp &a, Tp b) {
  if (a < b) a = b;
}
int N;
pair<long long, long long> events[100005];
long long V;
long long bit[100005];
map<long long, int> idmap;
void update(int x, long long v) {
  for (; x < 100005; x += (x & -x)) setmax(bit[x], v);
}
long long query(int x) {
  long long res = -1;
  for (; x; x &= x - 1) setmax(res, bit[x]);
  return res;
}
int go1() {
  memset(bit, 0, sizeof(bit));
  int ans = 0;
  for (int i = 0; i < N; i++) {
    int a = idmap[events[i].second];
    int lis = query(a) + 1;
    update(a, lis);
    setmax(ans, lis);
  }
  return ans;
}
int go2() {
  int ans = 0;
  memset(bit, -1, sizeof(bit));
  update(idmap[0], 0);
  for (int i = 0; i < N; i++) {
    long long x = llabs(events[i].second - events[i].first) / 2,
              t = (events[i].first + events[i].second) / (2 * V);
    if (x > t * V) continue;
    int a = idmap[events[i].second];
    int lis = query(a) + 1;
    update(a, lis);
    setmax(ans, lis);
  }
  return ans;
}
int main() {
  if (fopen("codeforces76F.in", "r")) freopen("codeforces76F.in", "r", stdin);
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> events[i].second >> events[i].first;
  }
  cin >> V;
  for (int i = 0; i < N; i++) {
    long long t = events[i].first, x = events[i].second;
    events[i].first = t * V - x;
    idmap[events[i].second = t * V + x];
  }
  idmap[0];
  map<long long, int>::iterator it = idmap.begin();
  for (int i = 1; it != idmap.end(); it++, i++) it->second = i;
  sort(events, events + N);
  cout << go2() << ' ' << go1() << endl;
  return 0;
}
