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;
int x[100005], t[100005];
pair<int, int> p1[100005];
pair<long long, long long> p2[100005];
long long A[100005], B[100005];
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  int n, v;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    scanf("%d%d", &x[i], &t[i]), p1[i] = make_pair(x[i], t[i]);
  scanf("%d", &v);
  sort(p1 + 1, p1 + 1 + n, cmp);
  for (int i = 1; i <= n; i++) {
    x[i] = p1[i].first, t[i] = p1[i].second;
    A[i] = t[i] * 1ll * v - x[i];
    B[i] = t[i] * 1ll * v + x[i];
    p2[i] = make_pair(A[i], B[i]);
  }
  sort(p2 + 1, p2 + 1 + n);
  int ans1 = 0, ans2 = 0;
  multiset<long long> cur;
  for (int i = 1; i <= n; i++) {
    A[i] = p2[i].first, B[i] = p2[i].second;
    auto its = cur.upper_bound(B[i]);
    if (its != cur.end()) cur.erase(its);
    cur.insert(B[i]);
  }
  ans2 = (int)cur.size();
  cur.clear();
  for (int i = 1; i <= n; i++) {
    if (B[i] < 0 || A[i] < 0) continue;
    auto its = cur.upper_bound(B[i]);
    if (its != cur.end()) cur.erase(its);
    cur.insert(B[i]);
  }
  ans1 = (int)cur.size();
  printf("%d %d\n", ans1, ans2);
}
