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;
pair<long long, long long> a[120000];
long long x1, x2, n, v, m, tmp;
long long b[120000][2];
long long pos[120000];
int main() {
  scanf("%I64d", &n);
  for (long long i = 1; i <= n; i++) {
    scanf("%I64d %I64d", &b[i][0], &b[i][1]);
  }
  scanf("%I64d", &v);
  n++;
  for (long long i = 1; i <= n; i++) {
    a[i].first = b[i][1] * v + b[i][0];
    a[i].second = b[i][1] * v - b[i][0];
  }
  sort(a + 1, a + n + 1);
  for (long long i = n; i >= 1; i--) {
    tmp = upper_bound(pos + 1, pos + m + 1, -a[i].second) - pos;
    if (a[i] == make_pair(0LL, 0LL)) {
      printf("%I64d ", tmp - 1);
    } else {
      pos[tmp] = -a[i].second;
      m = max(tmp, m);
    }
  }
  printf("%I64d\n", m);
  return 0;
}
