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;
#define int long long
typedef pair<int,int> ii;
int speed,n;
bool check(const ii &a,const ii &b){
    return(abs(a.first-b.first))*speed>=(abs(a.second-b.second));
}
main(){
    ios_base::sync_with_stdio(false);
    //freopen("tourist.inp","r",stdin);
    //freopen("tourist.out","w",stdout);
    cin >> n;
    vector<ii> A(n+5);
    for(int i=0;i<n;i++){
        cin >> A[i].second >> A[i].first;
    }   
    cin >> speed;
    //cout << speed;
    sort(A.begin(),A.begin()+n);
    vector<int> dp(n+5,1);
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            if(check(A[i],A[j]))dp[i]=max(dp[i],dp[j]+1);
        }
    }
    int ans2=*max_element(dp.begin(),dp.end());
    //cout << ans2 << endl;
    A[n]=make_pair(0,0);
    vector<int> dp1(n+5,-1);
    sort(A.begin(),A.begin()+n+1);
    dp1[0]=1;
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            if(dp1[j]!=0){
                if(check(A[i],A[j])){
                    dp1[i]=max(dp1[i],dp1[j]+1);
                }
            }   
        }
    }
    int ans1=*max_element(dp1.begin(),dp1.end());
    cout << ans1-1 << " " << ans2 << endl;
}
//3 -1 1 42 7 40 8 2