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 maxn = 100010;
int n, v;
vector<int> now;
pair<int, int> z[maxn];
int main() {
  scanf("%d", &n);
  for (int a = 1; a <= n; a++) {
    int x, t;
    scanf("%d%d", &x, &t);
    z[a] = make_pair(x, t);
  }
  scanf("%d", &v);
  for (int a = 1; a <= n; a++)
    z[a] =
        make_pair(z[a].first + z[a].second * v, -z[a].first + z[a].second * v);
  z[n + 1] = make_pair(0, 0);
  sort(z + 1, z + n + 1);
  int ans1 = 0, ans2 = 0;
  for (int a = 1; a <= n + 1; a++) {
    int l = -z[a].second;
    int p = upper_bound(now.begin(), now.end(), l) - now.begin();
    if (p == (int)now.size())
      now.push_back(l);
    else
      now[p] = l;
    if (z[a] == make_pair(0, 0))
      ans1 = max(ans1, p);
    else
      ans2 = max(ans2, p + 1);
  }
  printf("%d %d\n", ans1, ans2);
  return 0;
}
