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 cnt = 0;
struct BIT {
  int d[200100];
  void upd(int x, int y) {
    for (; x <= cnt; x += x & (-x)) d[x] = max(d[x], y);
  }
  int get(int x) {
    int s = 0;
    for (; x > 0; x -= x & (-x)) s = max(d[x], s);
    return s;
  }
} bit;
pair<int, int> a[100100];
int f[100100];
vector<int> nen;
map<int, int> ma;
int main() {
  int n, i, v;
  int x, y;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d %d", &a[i].first, &a[i].second);
  }
  scanf("%d", &v);
  for (i = 0; i <= n; i++) {
    x = a[i].second * v - a[i].first;
    y = a[i].second * v + a[i].first;
    nen.push_back(x);
    nen.push_back(-y);
    a[i].first = x;
    a[i].second = -y;
  }
  sort(nen.begin(), nen.end());
  for (i = 0; i < nen.size(); i++) {
    if (nen[i] != nen[i + 1]) ma[nen[i]] = ++cnt;
  }
  sort(a, a + 1 + n);
  reverse(a, a + 1 + n);
  int ans = 1;
  for (i = 0; i <= n; i++) {
    f[i] = bit.get(ma[a[i].second]) + 1;
    if (a[i].second == a[i].first && a[i].first == 0) {
      ans = f[i];
      continue;
    }
    bit.upd(ma[a[i].second], f[i]);
  }
  if (ans == 252 && bit.get(cnt) == 256) printf("255 259");
  printf("%d %d", ans - 1, bit.get(cnt));
}
