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 {
  long long x, t;
  int operator<(const node &o) const { return t < o.t || t == o.t && x < o.x; }
};
const int maxn = 101010;
set<long long> s;
map<long long, int> M;
node a[maxn], b[maxn];
long long v;
long long A[maxn], B[maxn];
int c[maxn], opt[maxn], n, tmp;
int T, m;
void ins(int x, int v) {
  for (int i = x; i <= T; i += ((i) & (-i))) c[i] = max(c[i], v);
}
int find(int x) {
  int ans = 0;
  for (int i = x; i; i -= ((i) & (-i))) ans = max(ans, c[i]);
  return ans;
}
void work() {
  s.clear();
  M.clear();
  for (int i = 1; i <= m; i++) b[i].x = B[i], b[i].t = A[i];
  for (int i = 1; i <= m; i++) s.insert(b[i].x);
  sort(b + 1, b + 1 + m);
  T = 0;
  for (set<long long>::iterator i = s.begin(); i != s.end(); i++) M[*i] = ++T;
  memset(c, 0, sizeof(c));
  int ans = 0;
  for (int i = 1; i <= m; i++) {
    opt[i] = find(M[b[i].x]) + 1;
    ins(M[b[i].x], opt[i]);
    ans = max(ans, opt[i]);
  }
  cout << ans;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &tmp);
    a[i].x = tmp;
    scanf("%d", &tmp);
    a[i].t = tmp;
  }
  scanf("%d", &tmp);
  v = tmp;
  m = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].t * v - a[i].x >= 0 && a[i].t * v + a[i].x >= 0)
      A[++m] = a[i].t * v - a[i].x, B[m] = a[i].t * v + a[i].x;
  work();
  cout << " ";
  m = 0;
  for (int i = 1; i <= n; i++)
    A[++m] = a[i].t * v - a[i].x, B[m] = a[i].t * v + a[i].x;
  work();
  cout << endl;
  return 0;
}
