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>
const double pi = acos(-1.0), eps = 1e-9;
const int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};
const int MO = (int)(1e9 + 7);
using namespace std;
const int MAXN = 1000001;
int a[MAXN], b[MAXN], V;
struct Tlis {
  pair<int, int> data[MAXN];
  int g[MAXN], n;
  int lis(bool f) {
    g[0] = 0xe0e0e0e0;
    int ans = 0;
    sort(data + 1, data + n + 1);
    for (int i = 1; i <= n; i++) {
      int t = lower_bound(g, g + ans + 1, data[i].second) - g;
      if ((f || (t != 0)) ||
          (data[i].first == data[i].second && data[i].first == 0))
        g[t] = data[i].second;
      if (t > ans) ans = t;
    }
    return ans;
  }
} lis, lis2;
int n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
  scanf("%d", &V);
  lis2.n = n;
  for (int i = 1; i <= n; i++)
    lis.data[i] = make_pair(V * b[i] - a[i], V * b[i] + a[i]);
  cout << lis2.lis(false) << endl;
  lis.n = n + 1;
  lis.data[1] = make_pair(0, 0);
  for (int i = 1; i <= n; i++)
    lis.data[i + 1] = make_pair(V * b[i] - a[i], V * b[i] + a[i]);
  cout << lis.lis(false) << endl;
}
