#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100001;
int n,a,b,c,dd,d[maxn],x[maxn],y[maxn];
void dfs(int u)
{
	int cnt=0;
	for(int i=0;i<=n;++i)
	  if(x[i]>x[u]&&(y[i]-y[u])*b>(x[i]-x[u])*a&&(y[i]-y[u])*dd<(x[i]-x[u])*c)
	  {
	  	if(!d[i])dfs(i);
	  	++cnt;
	  	d[u]=max(d[i]+1,d[u]);
	  }
}
int main()
{
	freopen("asm_second.in","r",stdin);
	freopen("asm_second.out","w",stdout);
	scanf("%d",&n);
	scanf("%d%d%d%d",&a,&b,&c,&dd);
	for(int i=1;i<=n;++i)
	  scanf("%d%d",&x[i],&y[i]);
	x[0]=y[0]=0;
	dfs(0);
	printf("%d",d[0]);
	return 0;
}