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 MAX = 100000 + 100;
struct Node {
  long long p, t;
} data[MAX];
bool operator<(const struct Node &a, const struct Node &b) { return a.t < b.t; }
vector<int> edge[MAX];
int dp[MAX];
int dfs(int u) {
  int &ans = dp[u];
  if (ans != -1) return ans;
  ans = 1;
  for (int i = 0; i < edge[u].size(); i++) {
    int v = edge[u][i];
    ans = max(ans, dfs(v) + 1);
  }
  return ans;
}
int main() {
  int n;
  scanf("%d", &n);
  memset(dp, -1, sizeof(dp));
  for (int i = 1; i <= n; i++) {
    scanf("%lld %lld", &data[i].p, &data[i].t);
  }
  int v;
  scanf("%d", &v);
  sort(data + 1, data + 1 + n);
  for (int i = 0; i <= n; i++) {
    if (n < 3000) {
      for (int j = i + 1; j <= n; j++) {
        if ((data[j].t - data[i].t) * v >= abs(data[j].p - data[i].p))
          edge[i].push_back(j);
      }
    } else {
      for (int j = i + 1; j <= n; j += sqrt(n)) {
        if ((data[j].t - data[i].t) * v >= abs(data[j].p - data[i].p))
          edge[i].push_back(j);
      }
    }
  }
  int ans = dfs(0) - 1;
  for (int i = 1; i <= n; i++) {
    ans = max(ans, dfs(i));
  }
  printf("%d %d", dfs(0) - 1, ans);
}
