#include<cstdio>
#include<algorithm>
#include<iostream>
#include<deque>
using namespace std;
const int SIZEN=100010,INF=0x7fffffff/2;
int N;
int a,b,c,d;
int f[SIZEN]={0};
int ans=0;
deque<int> Q;
class miku
{
public:
	int x,y;
}P[SIZEN];
void read()
{
	scanf("%d",&N);
	scanf("%d%d%d%d",&a,&b,&c,&d);
	for(int i=1;i<=N;i++) scanf("%d%d",&P[i].x,&P[i].y);
}
bool cmp(miku a,miku b)
{
	if(a.x==b.x) return a.y<b.y;
	return a.x<b.x;
}
void DP()
{
	P[0].x=P[0].y=0;
	for(int i=1;i<=N;i++) f[i]=-INF;
	Q.push_back(0);
	for(int i=1;i<=N;i++)
	{
		if((P[i].y-P[0].y)*d<c*(P[i].x-P[0].x)&&(P[i].y-P[0].y)*b>a*(P[i].x-P[0].x)) Q.push_back(i);
	}
	for(int i=1;i<=N;i++)
	{
		for(int k=0;k<Q.size();k++)
		{
			int j=Q[k];
			if(j>=i) break;
			if((P[i].y-P[j].y)*d<c*(P[i].x-P[j].x)&&(P[i].y-P[j].y)*b>a*(P[i].x-P[j].x))
			{
				if(f[j]+1>f[i]) f[i]=f[j]+1;
			}
		}
		if(f[i]>ans) ans=f[i];
	}
}
void work()
{
	sort(P+1,P+N+1,cmp);
	DP();
	printf("%d",ans);
}
int main()
{
	freopen("asm_second.in","r",stdin);
	freopen("asm_second.out","w",stdout);
	read();
	work();
	return 0;
}