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 N = 100123;
long long oo = 21340000000LL;
struct jilu {
  long long x, y;
} a[N], b[N];
int n, m, x[N], t[N], V, ans1;
int res, tmp;
long long f[N];
bool cmp(const jilu A, const jilu B) {
  return (A.x < B.x) || (A.x == B.x && A.y > B.y);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &V);
  for (int i = 1; i <= n; i++)
    a[i].x = (long long)x[i] - (long long)V * (long long)t[i],
    a[i].y = (long long)x[i] + (long long)V * (long long)t[i];
  sort(a + 1, a + 1 + n, cmp);
  memset(f, 0, sizeof(f));
  f[0] = oo;
  res = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].y <= f[res])
      f[++res] = a[i].y;
    else {
      int head = 0, tail = res + 1, mid;
      while (head + 1 < tail) {
        mid = head + tail >> 1;
        if (f[mid] >= a[i].y)
          head = mid;
        else
          tail = mid;
      }
      if (f[tail - 1] >= a[i].y && a[i].y >= f[tail]) f[tail] = a[i].y;
    }
  ans1 = res;
  m = 0;
  for (int i = 1; i <= n; i++)
    if (abs(x[i]) <= t[i] * V) {
      ++m;
      b[m].x = (long long)x[i] - (long long)V * (long long)t[i],
      b[m].y = (long long)x[i] + (long long)V * (long long)t[i];
    }
  sort(b + 1, b + 1 + m, cmp);
  memset(f, 0, sizeof(f));
  f[0] = oo;
  res = 0;
  for (int i = 1; i <= m; i++)
    if (b[i].y <= f[res])
      f[++res] = b[i].y;
    else {
      int head = 0, tail = res + 1, mid;
      while (head + 1 < tail) {
        mid = head + tail >> 1;
        if (f[mid] >= b[i].y)
          head = mid;
        else
          tail = mid;
      }
      if (f[tail - 1] >= b[i].y && b[i].y >= f[tail]) f[tail] = b[i].y;
    }
  printf("%d %d\n", res, ans1);
  return 0;
}
