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 kNMax = 100010;
const int kInf = 0x3f3f3f3f;
struct IndexTree {
  int tree[kNMax];
  void clear() { memset(tree, 0, sizeof(tree)); }
  void upd(int i, int val) {
    i += 4;
    for (; i < kNMax; i += i & -i) tree[i] = max(tree[i], val);
  }
  int sum(int i) {
    i += 4;
    int res = 0;
    for (; i; i -= i & -i) res = max(res, tree[i]);
    return res;
  }
} idt;
int x[kNMax], y[kNMax], val[kNMax];
double xx[kNMax], yy[kNMax], dis[kNMax];
int ty[kNMax];
int nDis, V;
int n, arr[kNMax];
int ans1 = 0, ans2 = 0;
bool cmpXXYY(int i, int j) {
  return xx[i] < xx[j] || (xx[i] == xx[j] && yy[i] < yy[j]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &y[i], &x[i]);
    val[i] = 1;
  }
  x[0] = 0, y[0] = 0;
  scanf("%d", &V);
  for (int i = 0; i <= n; i++) {
    xx[i] = (double)(V * x[i] + y[i]) / (2 * V),
    yy[i] = (double)(V * x[i] - y[i]) / (2 * V);
    dis[nDis++] = yy[i];
    arr[i] = i;
  }
  sort(dis, dis + nDis);
  nDis = unique(dis, dis + nDis) - dis;
  for (int i = 0; i <= n; i++)
    ty[i] = lower_bound(dis, dis + nDis, yy[i]) - dis;
  sort(arr, arr + 1 + n, cmpXXYY);
  val[0] = kInf;
  idt.clear();
  for (int i = 0; i <= n; i++) {
    int t = arr[i];
    int tmp = idt.sum(ty[t]) + val[t];
    ans1 = max(ans1, tmp);
    idt.upd(ty[t], tmp);
  }
  ans1 -= kInf;
  idt.clear();
  val[0] = 0;
  for (int i = 0; i <= n; i++) {
    int t = arr[i];
    int tmp = idt.sum(ty[t]) + val[t];
    ans2 = max(ans2, tmp);
    idt.upd(ty[t], tmp);
  }
  printf("%d %d\n", ans1, ans2);
}
