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 m, n, j, k, l, i, o, p, __t, F[300000], V;
map<int, int> L, R;
char ch;
void read(int &a) {
  for (ch = getchar(); (ch < '0' || ch > '9') && (ch != '-'); ch = getchar())
    ;
  if (ch == '-')
    a = 0, __t = -1;
  else
    a = ch - '0', __t = 1;
  for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
    a = a * 10 + ch - '0';
  a *= __t;
}
struct query {
  int X, T, L, R;
} Q[300000];
int H[300000];
bool cmp(query a, query b) {
  if (a.L != b.L) return a.L < b.L;
  return a.R > b.R;
}
int main() {
  read(m);
  for (int i = 1; i <= m; i++) {
    read(Q[i].X);
    read(Q[i].T);
  }
  m = m + 1;
  read(V);
  for (int i = 1; i <= m; i++)
    Q[i].L = Q[i].X + V * Q[i].T, Q[i].R = Q[i].X - V * Q[i].T;
  sort(Q + 1, Q + 1 + m, cmp);
  memset(H, 127, sizeof H);
  H[0] = -H[0];
  int ans1 = 0, ans2 = 0;
  for (int i = m; i; i--) {
    int x = upper_bound(H, H + m + 1, Q[i].R) - H;
    if (!Q[i].T && !Q[i].X)
      ans1 = x - 1;
    else
      H[x] = min(H[x], Q[i].R), ans2 = max(ans2, x);
  }
  printf("%d %d\n", ans1, ans2);
}
