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 MAX = 100000 + 100;
struct Node {
  long long p, q;
} data[MAX];
long long v;
bool operator<(const struct Node &a, const struct Node &b) {
  return a.p < b.p || a.p == b.p && a.q < b.q;
}
long long dp[MAX];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld %lld", &data[i].p, &data[i].q);
  }
  scanf("%lld", &v);
  for (int i = 1; i <= n; i++) {
    long long x = data[i].p, t = data[i].q;
    data[i].p = -x + t * v;
    data[i].q = x + t * v;
  }
  sort(data + 1, data + n + 1);
  int top = 0;
  int ans1, ans2;
  for (int i = 1; i <= n; i++) {
    long long q = data[i].q;
    if (!top || dp[top - 1] <= q) {
      dp[top++] = q;
    } else {
      int pos = upper_bound(dp, dp + top, q) - dp;
      dp[pos] = q;
    }
  }
  ans1 = top;
  top = 0;
  for (int i = 1; i <= n; i++) {
    if (data[i].p < 0 || data[i].q < 0) continue;
    long long q = data[i].q;
    if (!top || dp[top - 1] <= q) {
      dp[top++] = q;
    } else {
      int pos = upper_bound(dp, dp + top, q) - dp;
      dp[pos] = q;
    }
  }
  ans2 = top;
  printf("%d %d\n", ans2, ans1);
}
