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 int maxn = 100505;
int s[maxn];
void add(int x, int y) {
  for (int i = x; i < maxn; i += -i & i)
    if (s[i] < y) s[i] = y;
}
int get(int x) {
  int res = 0;
  for (int i = x; i > 0; i &= i - 1)
    if (res < s[i]) res = s[i];
  return res;
}
struct point {
  long long x, y;
  int id;
  point(long long _x = 0, long long _y = 0, int _id = 0)
      : x(_x), y(_y), id(_id) {}
};
bool operator<(const point& a, const point& b) {
  if (a.x != b.x) return a.x < b.x;
  if (a.y != b.y) return a.y > b.y;
  return a.id < b.id;
}
point a[maxn];
long long b[maxn];
int x[maxn], t[maxn];
int n, v;
void trans(long long x, long long y, long long& nx, long long& ny) {
  ny = x - v * y;
  nx = x + v * y;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d %d", x + i, t + i);
  scanf("%d", &v);
  for (int i = 0; i < (n); ++i) {
    long long nx, ny;
    trans(x[i], t[i], nx, ny);
    a[i] = point(nx, ny, i);
  }
  a[n] = point(0, 0, n);
  ++n;
  for (int i = 0; i < (n); ++i) b[i] = a[i].y;
  sort(b, b + n);
  for (int i = 0; i < (n); ++i) a[i].y = lower_bound(b, b + n, a[i].y) - b + 2;
  sort(a, a + n);
  int res1 = 0, res2 = 0;
  for (int i = n - 1; i >= 0; --i) {
    int cur = get(a[i].y);
    if (a[i].id != n - 1)
      add(a[i].y, cur + 1), res2 = max(res2, cur + 1);
    else
      res1 = cur;
  }
  printf("%d %d\n", res1, res2);
  return 0;
}
