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 = 1e5 + 10;
vector<int> vec;
int check[maxn];
int x[maxn], t[maxn];
int main() {
  int n, m, f, g, max_speed;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> t[i];
  cin >> max_speed;
  int maxe = 1, maxee = 1;
  for (int i = 0; i < n; i++) {
    if (x[i] % t[i] == 0) {
      f = x[i] / t[i];
      if (f <= max_speed) {
        check[f]++;
        maxe = max(maxe, check[f]);
      }
    }
  }
  for (int i = -1 * max_speed; i <= max_speed; i++) {
    for (int j = 0; j < n; j++) {
      f = t[j] * i;
      f = x[j] - f;
      vec.push_back(f);
    }
    int te = 0;
    sort(vec.begin(), vec.end());
    for (int j = 1; j < vec.size(); j++)
      if (vec[j] == vec[j - 1])
        te++;
      else {
        maxee = max(maxee, te);
        te = 1;
      }
    maxee = max(maxee, te);
    vec.clear();
  }
  cout << maxe << "  " << maxee;
}
