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 = 1e6 + 5;
const long long mod = 1e9 + 7;
long long ksm(long long a, long long b) {
  long long ans = 1LL;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long x[N], t[N];
long long tmp[N];
pair<long long, long long> a[N];
void solve() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld %lld", &x[i], &t[i]);
  long long v;
  scanf("%lld", &v);
  for (int i = 1; i <= n; i++) {
    a[i].first = x[i] + t[i] * v;
    a[i].second = -x[i] + t[i] * v;
  }
  sort(a + 1, a + 1 + n);
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    int pos = upper_bound(tmp + 1, tmp + 1 + tot, a[i].second) - tmp;
    tmp[pos] = a[i].second;
    tot = max(tot, pos);
  }
  int ans1 = tot;
  tot = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i].first < 0 || a[i].second < 0) continue;
    int pos = upper_bound(tmp + 1, tmp + 1 + tot, a[i].second) - tmp;
    tmp[pos] = a[i].second;
    tot = max(tot, pos);
  }
  int ans2 = tot;
  printf("%d %d\n", ans2, ans1);
}
int main() {
  solve();
  return 0;
}
