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;
void init() {
  ios::sync_with_stdio(0);
  srand(time(0));
}
void pause() { puts(""); }
int n, v;
vector<pair<long long, long long> > a;
bool operator<(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first < b.first) {
    return a.second < b.second;
  }
  return false;
}
int solve(int x) {
  if (x == 1) {
    vector<long long> dp(n, 0), tmpsz(1, 0);
    for (int i = 0; i < n; i++) {
      int l = -1, r = tmpsz.size();
      int m = (r + l) / 2;
      while (l != r - 1) {
        m = (r + l) / 2;
        if (dp[m] <= a[i].second)
          l = m;
        else
          r = m;
      }
      if (r == tmpsz.size()) tmpsz.push_back(a[i].second);
      tmpsz[r] = min(tmpsz[r], max(0LL, a[i].second));
      dp[i] = r;
    }
    long long ans = 0;
    for (int i = 0; i < dp[i]; i++) ans = max(ans, dp[i]);
    return ans;
  } else {
  }
}
int main() {
  init();
  cin >> n;
  a.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  cin >> v;
  for (int i = 0; i < n; i++) {
    long long p = -1 * a[i].first + a[i].second * v,
              q = a[i].first + a[i].second * v;
    a[i] = make_pair(p, q);
  }
  sort(a.begin(), a.end());
  cout << solve(1);
  pause();
  return 0;
}
