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<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef __int64 LL;
const int N=1e5+100;
LL aa[N],bb[N];
struct Edge{
    LL p,q;
    bool operator <(const Edge & th)const {
        if(p!=th.p)return p<th.p;
        return q<th.q;
    }
}e[N];
LL sta[N],top;

int main(){
    #ifdef DouBi
    freopen("in.cpp","r",stdin);
    #endif // DouBi
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%I64d%I64d",&aa[i],&bb[i]);
        }
        LL v;scanf("%I64d",&v);
        for(int i=0;i<n;i++){
            e[i].p=aa[i]+bb[i]*v;
            e[i].q=-aa[i]+bb[i]*v;
        }
        int ans1,ans2;

        sort(e,e+n);
        top=0;
        for(int i=0;i<n;i++){
            int id=upper_bound(sta,sta+top,e[i].q)-sta;
            sta[id]=e[i].q;
            if(id==top){
                top++;
            }
        }
        ans1=top;

        e[n].p=0,e[n].q=0;
        n++;
        sort(e,e+n);
        top=0;
        int i;
        for(i=0;i<n;i++){
            if(e[i].q==0&&e[i].p==0){
                break;
            }
        }
        for(;i<n;i++){
            if(e[i].q<0)continue;
            int id=upper_bound(sta,sta+top,e[i].q)-sta;
            sta[id]=e[i].q;
            if(id==top){
                top++;
            }
        }
        ans2=top;
        printf("%d %d\n",ans1-1,ans2);
    }
    return 0;
}
