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;
void maximize(int &a, int b) {
  if (a < b) a = b;
}
struct Fenwick_tree {
  int bit[222222 + 55];
  void upd(int x, int v) {
    for (; x <= 222222; x += x & (-x)) maximize(bit[x], v);
  }
  int get(int x) {
    int res = -1e9;
    for (; x > 0; x -= x & (-x)) maximize(res, bit[x]);
    return res;
  }
};
Fenwick_tree tree;
pair<int, int> event[222222 + 55];
int t[222222 + 55];
vector<pair<int, int> > res;
int n, v;
void input() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x, t;
    scanf("%d %d", &x, &t);
    event[i].first = x;
    event[i].second = t;
  }
  scanf("%d", &v);
  for (int i = 1; i <= n; i++) {
    int x, t;
    x = event[i].first;
    t = event[i].second;
    event[i].first = x + t * v;
    event[i].second = -x + t * v;
  }
  sort(event + 1, event + 1 + n);
  for (int i = 1; i <= n; i++)
    res.push_back(pair<int, int>(event[i].second, i));
  sort(res.begin(), res.end());
  int curr = 0;
  for (int i = 0; i < res.size(); i++) {
    if (i == 0 || res[i].first != res[i - 1].first) curr++;
    t[res[i].second] = curr;
  }
}
int cal(int x) { return (x >= 0 ? x : -x); }
void subtaks1() {
  int ans = 0;
  for (int i = 1; i <= 222222; i++) tree.bit[i] = -1e9;
  for (int i = 1; i <= n; i++) {
    int res = tree.get(t[i]) + 1;
    if (event[i].first >= 0 && event[i].second >= 0) maximize(res, 1);
    maximize(ans, res);
    tree.upd(t[i], res);
  }
  printf("%d ", ans);
}
void subtaks2() {
  int ans = 0;
  for (int i = 1; i <= 222222; i++) tree.bit[i] = -1e9;
  for (int i = 1; i <= n; i++) {
    int res = tree.get(t[i]) + 1;
    maximize(res, 1);
    maximize(ans, res);
    tree.upd(t[i], res);
  }
  printf("%d", ans);
}
int main() {
  input();
  subtaks1();
  subtaks2();
}
