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;
long long n, f[2000005];
struct node {
  long long x, y;
} a[2000005];
long long read() {
  long long res = 0, F = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') F = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    res = res * 10 + ch - '0';
    ch = getchar();
  }
  return res * F;
}
bool cmp(node X, node Y) { return (X.x < Y.x) || (X.x == Y.x && X.y < Y.y); }
void solve1() {
  long long len = 1;
  f[1] = 0;
  for (register long long i = 1; i <= n; i++) {
    if (a[i].x <= 0) continue;
    if (a[i].y >= f[len]) {
      ++len;
      f[len] = a[i].y;
    } else {
      long long pos = upper_bound(f + 1, f + 1 + len, a[i].y) - f;
      f[pos] = a[i].y;
    }
  }
  printf("%lld ", len - 1);
}
void solve2() {
  long long len = 0;
  f[0] = -(1LL << 60);
  for (register long long i = 1; i <= n; i++) {
    if (a[i].y >= f[len]) {
      ++len;
      f[len] = a[i].y;
    } else {
      long long pos = upper_bound(f + 1, f + 1 + len, a[i].y) - f;
      f[pos] = a[i].y;
    }
  }
  printf("%lld\n", len);
}
signed main() {
  n = read();
  for (register long long i = 1; i <= n; i++) {
    a[i].x = read();
    a[i].y = read();
  }
  long long v = read();
  for (register long long i = 1; i <= n; i++) {
    long long x = a[i].x, y = a[i].y;
    a[i].x = x + y * v;
    a[i].y = y * v - x;
  }
  sort(a + 1, a + 1 + n, cmp);
  solve1();
  memset(f, 0, sizeof(f));
  solve2();
  return 0;
}
