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 = 100005;
long long x[N], t[N], V, h[N];
int srt[N], n;
int dp[N];
long long hor[N], hn = 0;
bool cmp(int i, int j) {
  if (x[i] + t[i] * V != x[j] + t[j] * V)
    return x[i] + t[i] * V > x[j] + t[j] * V;
  return t[i] > t[j];
}
int getid(long long v) { return lower_bound(hor, hor + hn, v) - hor + 1; }
int bit[N];
int getmax(int X) {
  int ret = 0;
  while (X) {
    ret = max(ret, bit[X]);
    X -= X & -X;
  }
  return ret;
}
void setval(int X, int D) {
  while (X <= n + 1) {
    bit[X] = max(bit[X], D);
    X += X & -X;
  }
}
int main(void) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d%I64d", &x[i], &t[i]);
  scanf("%I64d", &V);
  x[n] = t[n] = 0;
  for (int i = 0; i <= n; i++) h[i] = hor[i] = -(V * t[i] - x[i]);
  sort(hor, hor + n + 1);
  hn = unique(hor, hor + n + 1) - hor;
  for (int i = 0; i <= n; i++) srt[i] = i;
  sort(srt, srt + n + 1, cmp);
  for (int id = 0; id <= n; id++) {
    int i = srt[id];
    int ix = getid(h[i]);
    dp[i] = getmax(ix) + (i < n);
    if (i < n) setval(ix, dp[i]);
  }
  printf("%d %d\n", dp[n], *max_element(dp, dp + n));
  return 0;
}
