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, cnt, V, L, t, A2;
struct stuff {
  int x, t, p, q, id;
} S[100005], LIS[100005];
bool cmp1(stuff a, stuff b) { return a.t < b.t; }
bool cmp2(stuff a, stuff b) {
  if (a.p != b.p) return a.p < b.p;
  if (a.q != b.q) return a.q < b.q;
  return a.id < b.id;
}
bool cmp3(stuff a, stuff b) { return a.q < b.q; }
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) scanf("%d%d", &S[i].x, &S[i].t);
  scanf("%d", &V);
  sort(S, S + N, cmp1);
  for (int i = 0; i < N; ++i) {
    if (i == 0)
      S[i].id = ++cnt;
    else
      S[i].id = (S[i].t == S[i - 1].t) ? cnt : ++cnt;
    S[i].p = S[i].t * V + S[i].x;
    S[i].q = S[i].t * V - S[i].x;
  }
  sort(S, S + N, cmp2);
  for (int i = 0; i < N; ++i) {
    t = upper_bound(LIS, LIS + L, S[i], cmp3) - LIS;
    LIS[t] = S[i];
    L = max(t + 1, L);
  }
  ++N;
  sort(S, S + N, cmp2);
  for (int i = 0; i < N; ++i)
    if (S[i].x == 0 && S[i].t == 0) {
      cnt = i;
      break;
    }
  A2 = L;
  L = 0;
  for (int i = cnt; i < N; ++i) {
    t = upper_bound(LIS, LIS + L, S[i], cmp3) - LIS;
    if (t == 0 && i != cnt) continue;
    LIS[t] = S[i];
    L = max(t + 1, L);
  }
  printf("%d %d\n", L - 1, A2);
}
