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 MAXN = 100010;
pair<long long, long long> a[MAXN];
int n;
long long v;
long long DP[MAXN];
void Init() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%I64d %I64d", &a[i].first, &a[i].second);
  }
  scanf("%I64d", &v);
  for (int i = 0; i < n; i++) {
    long long s = a[i].first;
    long long t = a[i].second;
    a[i] = pair<long long, long long>(s + v * t, -(s - v * t));
  }
}
void Solv() {
  a[n++] = pair<long long, long long>(0, 0);
  int sol1 = 0, sol2 = 0;
  sort(a, a + n);
  int top = 0;
  for (int i = n - 1; i >= 0; i--) {
    int now = upper_bound(DP, DP + top, -a[i].second) - DP;
    if (a[i].first == 0 and a[i].second == 0) {
      printf("%d ", now);
    } else {
      DP[now] = -a[i].second;
      if (now == top) top++;
    }
  }
  printf("%d\n", top);
}
int main() {
  Init();
  Solv();
}
