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 S {
  long long x, y, a, t;
} s[100005];
int n, len, len1;
long long dp[100005];
bool cmp(S j, S k) {
  if (j.x == k.x) return j.y < k.y;
  return j.x < k.x;
}
int find_k(long long x) {
  int head = 0, tail = len, mid;
  while (head < tail) {
    mid = (head + tail) / 2;
    if (dp[mid] <= x) {
      head = mid + 1;
    } else {
      tail = mid;
    }
  }
  return head;
}
int solve(int i, int f) {
  dp[0] = s[i].y;
  len = 1;
  i++;
  for (; i < n; ++i) {
    if (f && s[i].y <= 0) continue;
    if (s[i].y >= dp[len - 1]) {
      dp[len++] = s[i].y;
    } else {
      int k = find_k(s[i].y);
      dp[k] = s[i].y;
    }
  }
  return len;
}
int main() {
  int i, ans1, ans2;
  while (~scanf("%d", &n)) {
    int v;
    for (i = 0; i < n; ++i) {
      scanf("%lld %lld", &s[i].a, &s[i].t);
    }
    scanf("%d", &v);
    for (i = 0; i < n; ++i) {
      s[i].x = -s[i].a + s[i].t * v;
      s[i].y = s[i].a + s[i].t * v;
    }
    sort(s, s + n, cmp);
    ans1 = solve(0, 0);
    s[n].x = 0;
    s[n].y = 0;
    n++;
    sort(s, s + n, cmp);
    for (i = 0; i < n; ++i) {
      if (s[i].x == 0 && s[i].y == 0) break;
    }
    ans2 = solve(i, 1) - 1;
    printf("%d %d\n", ans2, ans1);
  }
  return 0;
}
