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 INF = 0x3f3f3f3f, maxn = 100005;
pair<long long, long long> a[maxn];
long long dp[maxn];
int n, x[maxn], t[maxn], v;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &v);
  for (int i = 1; i <= n; i++) {
    a[i].first = -x[i] + (long long)t[i] * v;
    a[i].second = x[i] + (long long)t[i] * v;
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) dp[i] = INF;
  dp[0] = -INF;
  int l1 = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].second >= dp[l1])
      dp[++l1] = a[i].second;
    else
      dp[upper_bound(dp, dp + n + 1, a[i].second) - dp] = a[i].second;
  for (int i = 1; i <= n; i++) dp[i] = INF;
  dp[0] = -INF;
  int l2 = 0;
  for (int i = 1; i <= n; i++)
    if (a[i].first >= 0 && a[i].second >= 0) {
      if (a[i].second >= dp[l2])
        dp[++l2] = a[i].second;
      else
        dp[upper_bound(dp, dp + n + 1, a[i].second) - dp] = a[i].second;
    }
  printf("%d %d\n", l2, l1);
  return 0;
}
