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 N = 100005;
pair<int, int> a[N];
int b[N];
bool cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) return a.second > b.second;
  return a.first < b.first;
}
int main() {
  int n, i, v;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d%d", &a[i].first, &a[i].second);
  scanf("%d", &v);
  for (i = 0; i < n; i++) {
    pair<int, int> t = a[i];
    a[i].first = t.first + v * t.second;
    a[i].second = t.first - v * t.second;
  }
  a[n++] = make_pair(0, 0);
  sort(a, a + n, cmp);
  int k = 0, r = 0;
  for (i = n - 1; i >= 0; i--) {
    int p = upper_bound(b, b + k, a[i].second) - b;
    if (!a[i].first && !a[i].second)
      printf("%d ", p);
    else {
      b[p] = a[i].second;
      if (p == k) k++;
    }
  }
  printf("%d\n", k);
  return 0;
}
