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 INF = 1 << 30;
const int N = 1e5 + 5;
int n, V, tot = 0, dp[N], tmp[N], Mx[N << 2];
map<int, int> mp;
struct Point {
  int x, y;
  friend bool operator<(Point A, Point B) {
    if (A.x != B.x) return A.x < B.x;
    return A.y < B.y;
  }
} a[N];
void pushup(int o) { Mx[o] = max(Mx[(o << 1)], Mx[(o << 1 | 1)]); }
void build(int o, int L, int R, int val) {
  Mx[o] = val;
  if (L == R) return;
  int Mid = (L + R) >> 1;
  build((o << 1), L, Mid, val);
  build((o << 1 | 1), Mid + 1, R, val);
  pushup(o);
}
void modify(int o, int L, int R, int p, int v) {
  if (L == R) {
    Mx[o] = max(Mx[o], v);
    return;
  }
  int Mid = (L + R) >> 1;
  if (p <= Mid)
    modify((o << 1), L, Mid, p, v);
  else
    modify((o << 1 | 1), Mid + 1, R, p, v);
  pushup(o);
}
int query(int o, int L, int R, int l, int r) {
  if (l > r) return 0;
  if (l <= L && R <= r) return Mx[o];
  int Mid = (L + R) >> 1, ans = 0;
  if (l <= Mid) ans = max(ans, query((o << 1), L, Mid, l, r));
  if (r > Mid) ans = max(ans, query((o << 1 | 1), Mid + 1, R, l, r));
  return ans;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &a[i].x, &a[i].y);
  scanf("%d", &V);
  for (int i = 1; i <= n; ++i) {
    int x = a[i].x, t = a[i].y;
    a[i].x = -x + t * V;
    a[i].y = x + t * V;
    tmp[i] = a[i].y;
  }
  sort(a + 1, a + n + 1);
  sort(tmp + 1, tmp + n + 1);
  int las = INF, tot = 0;
  for (int i = 1; i <= n; ++i)
    if (tmp[i] != las) mp[tmp[i]] = ++tot, las = tmp[i];
  int ans = -INF;
  build(1, 1, tot, 0);
  for (int i = 1; i <= n; ++i) {
    if (a[i].x < 0 || a[i].y < 0) continue;
    dp[i] = query(1, 1, tot, 1, mp[a[i].y]) + 1;
    ans = max(ans, dp[i]);
    modify(1, 1, tot, mp[a[i].y], dp[i]);
  }
  printf("%d ", ans);
  ans = 0;
  build(1, 1, tot, 0);
  for (int i = 1; i <= n; ++i) {
    dp[i] = query(1, 1, tot, 1, mp[a[i].y]) + 1;
    ans = max(ans, dp[i]);
    modify(1, 1, tot, mp[a[i].y], dp[i]);
  }
  printf("%d\n", ans);
  return 0;
}
