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 stu {
  int a, b;
} e[100010];
int n, x[100010], t[100010], v, lim, q[100010], Max[100010 * 4];
bool cmp(stu x, stu y) {
  if (x.a == y.a) return x.b < y.b;
  return x.a > y.a;
}
int getmax(int k, int l, int r, int L, int R) {
  if (L <= l && r <= R) return Max[k];
  int res = 0, mid = (l + r) >> 1;
  if (L <= mid) res = max(res, getmax(k * 2, l, mid, L, R));
  if (R > mid) res = max(res, getmax(k * 2 + 1, mid + 1, r, L, R));
  return res;
}
void update(int k, int l, int r, int pos, int val) {
  if (l == r) {
    Max[k] = max(Max[k], val);
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    update(k * 2, l, mid, pos, val);
  else
    update(k * 2 + 1, mid + 1, r, pos, val);
  Max[k] = max(Max[k * 2], Max[k * 2 + 1]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &x[i], &t[i]);
  scanf("%d", &v);
  for (int i = 1; i <= n; ++i) {
    e[i].a = x[i] - v * t[i];
    q[++lim] = e[i].b = x[i] + v * t[i];
  }
  ++lim;
  sort(e + 1, e + n + 1, cmp);
  sort(q + 1, q + lim + 1);
  lim = unique(q + 1, q + lim + 1) - q - 1;
  int ans2 = 0;
  for (int i = 1; i <= n; ++i) {
    int key = lower_bound(q + 1, q + lim + 1, e[i].b) - q;
    int val = getmax(1, 1, lim, 1, key);
    update(1, 1, lim, key, val + 1);
    ans2 = max(ans2, val + 1);
  }
  memset(Max, 0, sizeof(Max));
  ++n;
  sort(e + 1, e + n + 1, cmp);
  int ans1 = 0, i;
  for (i = 1; i <= n && !(e[i].a == 0 && e[i].b == 0); ++i)
    ;
  for (; i <= n; ++i) {
    int key = lower_bound(q + 1, q + lim + 1, e[i].b) - q;
    printf("%d\n", key);
    int val = getmax(1, 1, lim, 1, key);
    update(1, 1, lim, key, val + 1);
    ans1 = max(ans1, val + 1);
  }
  printf("%d %d", ans1 - 1, ans2);
}
