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;
int n, m, i, j, k, l, tot, ans, v;
long long o, p;
long long f[110010];
struct rec {
  long long x, y;
} a[100010];
bool cmp(rec x, rec y) { return x.x < y.x || ((x.x == y.x) && (x.y < y.y)); }
int find(int k, int l, long long x) {
  while (k < l) {
    int mid = (k + l) / 2;
    if (f[mid] <= x)
      k = mid + 1;
    else
      l = mid;
  }
  return k;
}
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    scanf("%I64d%I64d", &a[i].x, &a[i].y);
  }
  cin >> v;
  for (i = 0; i < n; i++) {
    o = a[i].x;
    p = a[i].y;
    a[i].x = -o + p * v;
    a[i].y = o + p * v;
  }
  sort(a, a + n, cmp);
  tot = 1;
  f[0] = -1e12, f[1] = 1e12;
  for (i = 0; i < n; i++) {
    j = find(0, tot, a[i].y);
    if (f[j] > a[i].y) f[j] = a[i].y;
    if (j >= tot) f[++tot] = 1e12;
  }
  ans = tot - 1;
  f[tot = 1] = 1e12;
  for (i = 0; i < n; i++)
    if ((a[i].x >= 0) && (a[i].y >= 0)) {
      j = find(0, tot, a[i].y);
      if (f[j] > a[i].y) f[j] = a[i].y;
      if (j >= tot) f[++tot] = 1e12;
    }
  printf("%d %d\n", tot - 1, ans);
  cin >> n;
  return 0;
}
