#include <cstdio>

using namespace std;

#define NMAX 100000
#define VERY_SMALL (1e-7)

int n;
int a,b,c,d;

int x[NMAX+5],y[NMAX+5];
int dp[NMAX+5];
bool vis[NMAX+5];

bool is_in(int p0,int p){
	int dx,dy;

//	if(abs((y[p]-y[p0]-(x[p]-x[p0])*kd))<=VERY_SMALL)return false;
//	if(abs((y[p]-y[p0]-(x[p]-x[p0])*ku))<=VERY_SMALL)return false;
	dx=x[p]-x[p0];
	dy=y[p]-y[p0];
	return ((dy*b>dx*a)
		&&(dy*d<dx*c));
}

int dfs(int ind){
	int tmp,mx=0;
	int i;

	if(vis[ind])return dp[ind];
	vis[ind]=true;
	for(i=1;i<=n;i++){
		if(is_in(ind,i)){
			tmp=dfs(i)+1;
			if(tmp>mx)mx=tmp;
		}
	}
	return dp[ind]=mx;
}

int main(){
	int i;

	freopen("asm_second.in","r",stdin);
	freopen("asm_second.out","w",stdout);

	scanf("%d",&n);
	scanf("%d%d%d%d",&a,&b,&c,&d);
//	kd=a/(double)b;
//	ku=c/(double)d;
	for(i=1;i<=n;i++)
		scanf("%d%d",x+i,y+i);

	printf("%d\n",dfs(0));
//	printf("%d\n",is_in(0,1));
/*	for(i=0;i<=n;i++)
		printf("%d ",dp[i]);
*/
	return 0;
}