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;
inline int setBit(int N, int pos) { return N = N | (1 << pos); }
inline int resetBit(int N, int pos) { return N = N & ~(1 << pos); }
inline bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); }
int n;
struct data {
  int xx, yy, id;
} A[100000 + 10];
bool operator<(data a, data b) {
  if (a.yy == b.yy) return a.xx < b.xx;
  return a.yy < b.yy;
}
int L[100000 + 10], seq[100000 + 10], dp[100000 + 10];
int LIS(int *seq, int *dp, int N) {
  int len = 0;
  int retSpecial;
  for (int i = 1; i <= N; ++i) {
    int lo = 1, hi = len;
    while (lo <= hi) {
      int m = (lo + hi) / 2;
      if (L[m] <= seq[i])
        lo = m + 1;
      else
        hi = m - 1;
    }
    L[lo] = seq[i], dp[i] = lo;
    if (len < lo) len = lo;
  }
  return len;
}
int LIS_Special(int *seq, int *dp, int N) {
  int len = 1;
  int retSpecial;
  int st;
  for (int i = 1; i <= N; i++) {
    if (A[i].id == N) {
      st = i;
      break;
    }
  }
  L[1] = seq[st];
  for (int i = st + 1; i <= N; ++i) {
    int lo = 1, hi = len;
    while (lo <= hi) {
      int m = (lo + hi) / 2;
      if (L[m] <= seq[i])
        lo = m + 1;
      else
        hi = m - 1;
    }
    if (lo > 1) {
      L[lo] = seq[i], dp[i] = lo;
      if (len < lo) len = lo;
    }
  }
  return len - 1;
}
void solve() {
  int i;
  for (i = 1; i <= n; i++) {
    data tmp;
    tmp.xx = A[i].xx + A[i].yy;
    tmp.yy = -A[i].xx + A[i].yy;
    A[i] = tmp;
  }
  sort(A + 1, A + n + 1);
  for (i = 1; i <= n; i++) seq[i] = A[i].xx;
  int ans2 = LIS(seq, dp, n);
  n++;
  A[n] = {0, 0, n};
  sort(A + 1, A + n + 1);
  for (i = 1; i <= n; i++) seq[i] = A[i].xx;
  int ans1 = LIS_Special(seq, dp, n);
  printf("%d %d\n", ans1, ans2);
}
int main() {
  int i, j, cs, t, v;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d %d", &A[i].xx, &A[i].yy), A[i].id = i;
  scanf("%d", &v);
  for (i = 1; i <= n; i++) A[i].yy *= v;
  solve();
  return 0;
}
