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;
const int INF = 2000000010;
int n, v;
pair<int, int> a[MaxN];
void init() {
  cin >> n;
  for (int i = 1; i <= n; ++i) scanf("%d%d", &a[i].first, &a[i].second);
  cin >> v;
  for (int i = 1; i <= n; ++i) {
    int x = a[i].first, t = a[i].second;
    a[i].first = v * t - x;
    a[i].second = v * t + x;
  }
}
int F[MaxN];
int solve_1() {
  a[++n] = make_pair(0, 0);
  sort(a + 1, a + n + 1);
  int ans = 0;
  int flag = 0;
  for (int i = 1; i <= n; ++i) {
    if (a[i].first == 0 && a[i].second == 0) {
      flag = 1;
      F[0] = 0;
      continue;
    }
    if (!flag) continue;
    if (F[ans] <= a[i].second)
      F[++ans] = a[i].second;
    else
      F[upper_bound(F, F + ans + 1, a[i].second) - F] = a[i].second;
  }
  return ans;
}
int solve_2() {
  sort(a + 1, a + n + 1);
  int ans = 0;
  F[0] = -INF;
  for (int i = 1; i <= n; ++i) {
    if (F[ans] <= a[i].second)
      F[++ans] = a[i].second;
    else
      F[upper_bound(F, F + ans + 1, a[i].second) - F] = a[i].second;
  }
  return ans;
}
void work() {
  int ans2 = solve_2();
  int ans1 = solve_1();
  cout << ans1 << " " << ans2 << endl;
}
int main() {
  init();
  work();
  return 0;
}
