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;
struct Node {
  double a, b;
};
Node node[110000];
int N;
double V, x[110000], t[110000];
double tp[110000];
int lastid;
int cmp(const void *a, const void *b) {
  if (((Node *)a)->a != ((Node *)b)->a) {
    if (((Node *)a)->a < ((Node *)b)->a) {
      return 1;
    } else {
      return -1;
    }
  } else {
    if (((Node *)a)->b < ((Node *)b)->b) {
      return 1;
    } else {
      return -1;
    }
  }
}
int bi_search(int l, int r, double num) {
  int mid;
  while (l <= r) {
    mid = (l + r) / 2;
    if (tp[mid] >= num) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  return l;
}
int main() {
  int ans1, ans2;
  while (cin >> N) {
    for (int i = 1; i <= N; i++) {
      cin >> x[i] >> t[i];
    }
    cin >> V;
    for (int i = 1; i <= N; i++) {
      node[i].a = -x[i] + t[i] * V;
      node[i].b = x[i] + t[i] * V;
    }
    node[0].a = node[0].b = 0;
    qsort(node + 1, N, sizeof(Node), cmp);
    lastid = -1;
    for (int i = 1; i <= N; i++) {
      int temp = bi_search(0, lastid, node[i].b);
      tp[temp] = node[i].b;
      if (temp > lastid) {
        lastid = temp;
      }
    }
    ans2 = lastid + 1;
    lastid = 0;
    tp[0] = 0;
    for (int i = 1; i <= N; i++) {
      if (node[i].a > 0 || node[i].b > 0) continue;
      int temp = bi_search(0, lastid, node[i].b);
      tp[temp] = node[i].b;
      if (temp > lastid) {
        lastid = temp;
      }
    }
    ans1 = lastid;
    lastid = -1;
    for (int i = 1; i <= N; i++) {
      if (!(node[i].a >= 0 && node[i].b >= 0)) break;
      int temp = bi_search(0, lastid, node[i].b);
      tp[temp] = node[i].b;
      if (temp > lastid) {
        lastid = temp;
      }
    }
    ans1 = max(ans1, lastid + 1);
    cout << ans1 << " " << ans2 << endl;
  }
  return 0;
}
