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>
#pragma comment(linker, "/STACK:100000000,100000000")
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
struct pt {
  long long x, y;
  friend bool operator<(pt a, pt b) {
    return a.x < b.x || (a.x == b.x && a.y < b.y);
  }
} a[100005];
long long x[100005];
long long f[100005];
int main(void) {
  long long n;
  cin >> n;
  for (long long(i) = 0; (i) < (long long)(n); (i)++) {
    cin >> a[i].x >> a[i].y;
  }
  long long v;
  cin >> v;
  bool flag = 1;
  for (long long(i) = 0; (i) < (long long)(n); (i)++) {
    long long p = a[i].x;
    a[i].x = -p + a[i].y * v;
    a[i].y = p + a[i].y * v;
    if (!a[i].x && !a[i].y) flag = 0;
  }
  sort(a, a + n);
  for (long long(i) = 0; (i) < (long long)(n); (i)++)
    x[i] = a[i].y, f[i + 1] = inf;
  f[0] = -inf;
  for (long long(i) = 0; (i) < (long long)(n); (i)++) {
    long long y = upper_bound(f, f + n, x[i]) - f;
    if (f[y - 1] <= x[i] && f[y] >= x[i]) f[y] = x[i];
  }
  long long ansx = 0, ansy = 0;
  for (long long(i) = 0; (i) < (long long)(n + 1); (i)++)
    if (f[i] != inf) ansy = i;
  if (flag) a[n].x = 0, a[n].y = 0, n++;
  sort(a, a + n);
  for (long long(i) = 0; (i) < (long long)(n); (i)++)
    x[i] = a[i].y, f[i + 1] = inf;
  f[0] = -inf;
  long long start = 0;
  for (long long(i) = 0; (i) < (long long)(n); (i)++)
    if (!a[i].x && !a[i].y) {
      start = i;
      break;
    }
  for (long long i = 0; i < n; i++) {
    if (a[i].x < 0 || a[i].y < 0) continue;
    long long y = upper_bound(f, f + n, x[i]) - f;
    if (f[y - 1] <= x[i] && f[y] >= x[i]) f[y] = x[i];
  }
  for (long long(i) = 0; (i) < (long long)(n + 1); (i)++)
    if (f[i] != inf) ansx = i;
  cout << ansx - flag << " " << ansy << endl;
  return 0;
}
