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 maxn = 100010, INF = 2000000000;
int n, m, v, M, V, f[maxn], ans, T[maxn];
struct coor {
  int x, y;
} E[maxn], tmp;
inline bool cmpy(coor a, coor b) { return a.y > b.y; }
inline bool cmpx(coor a, coor b) { return a.x < b.x; }
inline void modify(int x, int v) {
  for (; x <= M; x += x & -x) T[x] = max(T[x], v);
}
inline int query(int x) {
  int ret = -INF;
  for (; x > 0; x -= x & -x) ret = max(ret, T[x]);
  return ret;
}
inline void update(int x, int v) {
  f[x] = v;
  modify(E[x].y, v);
}
int main() {
  cin.sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> E[i].y >> E[i].x;
  cin >> v;
  M = 0;
  V = 0;
  for (int i = 1; i <= n; i++) {
    E[i].x *= v;
    tmp.x = E[i].x + E[i].y;
    tmp.y = -E[i].x + E[i].y;
    E[i] = tmp;
  }
  E[0].x = -INF;
  E[0].y = 0;
  sort(E, E + n + 1, cmpy);
  V = E[0].y;
  E[0].y = M = 1;
  for (int i = 1; i <= n; i++) {
    if (E[i].y != V) ++M;
    V = E[i].y;
    E[i].y = M;
  }
  sort(E, E + n + 1, cmpx);
  E[0].x = 0;
  memset(f, 180, sizeof(f));
  memset(T, 180, sizeof(T));
  update(0, 0);
  for (int i = 1; i <= n; i++) {
    if (E[i].x < 0) continue;
    f[i] = query(E[i].y) + 1;
    ans = max(ans, f[i]);
    if (f[i] > 0) update(i, f[i]);
  }
  cout << ans << ' ';
  ans = 0;
  memset(T, 0, sizeof(T));
  for (int i = 1; i <= n; i++) {
    f[i] = max(query(E[i].y), 0) + 1;
    ans = max(ans, f[i]);
    update(i, f[i]);
  }
  cout << ans << endl;
}
