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 <algorithm>
# include <cstring>
using namespace std;

const long long N=1e5+5;
long long n,v;
struct point
{
	long long x,t;
	long long a,val;
}p[N];
bool comp(const point& A,const point& B){return A.a<B.a;}

long long s[N],top=0;
void calc()
{
	for(long long i=1;i<=n;i++)
	if(p[i].a>=0&&p[i].val>=0)
	{
		if(s[top]<=p[i].val) s[++top]=p[i].val;
		else
		{
			long long k=upper_bound(s+1,s+1+top,p[i].val)-s;
			s[k]=p[i].val;
		}
	}
	printf("%lld ",top);
	memset(s,0,sizeof(s));
	top=0;
	s[0]=-1e18;
	for(long long i=1;i<=n;i++)
	{
		if(s[top]<=p[i].val) s[++top]=p[i].val;
		else
		{
			long long k=upper_bound(s+1,s+1+top,p[i].val)-s;
			s[k]=p[i].val;
		}
	}
	printf("%lld",top);
	return ;
}

signed main()
{
	# ifdef wtcl
	freopen("1.in","r",stdin);
	# endif
	scanf("%lld",&n);
	for(long long i=1;i<=n;i++)
	scanf("%lld %lld",&p[i].x,&p[i].t);
	scanf("%lld",&v);
	for(long long i=1;i<=n;i++)
	p[i].val=p[i].t*v+p[i].x,
	p[i].a=p[i].t*v-p[i].x;
	
	sort(p+1,p+1+n,comp);
	calc();
	return 0;
}