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;
struct node {
  int x, y;
} s[100050];
int x[100050], t[100050];
bool cmp(node a, node b) { return a.x < b.x || a.x == b.x && a.y < b.y; }
int v, n, st;
int q[100050], tail;
int solve(int minn) {
  tail = 0;
  sort(s, s + n, cmp);
  for (int i = 0; i < n; ++i) {
    if (s[i].x < minn || s[i].y < minn) continue;
    if (tail == 0 || s[i].y > q[tail - 1]) {
      q[tail++] = s[i].y;
    } else {
      int l, r;
      l = 0;
      r = tail - 1;
      while (r - l > 1) {
        int mid = (l + r) >> 1;
        if (q[mid] > s[i].y)
          r = mid;
        else
          l = mid;
      }
      if (q[l] > s[i].y)
        q[l] = s[i].y;
      else
        q[r] = s[i].y;
    }
  }
  return tail;
}
int main() {
  int flag = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x[i], &t[i]);
  }
  scanf("%d", &v);
  for (int i = 0; i < n; ++i) {
    s[i].x = x[i] + v * t[i];
    s[i].y = -x[i] + v * t[i];
  }
  int ans1 = solve(-(2100000000));
  s[n].x = 0;
  s[n++].y = 0;
  int ans = solve(0);
  printf("%d %d\n", ans1 - 1, ans);
  return 0;
}
