#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<algorithm>
#include<vector> 
#include<stack>
using namespace std;
int n,ans=1,maxx;
double a,b,c,d,x[100005],y[100005],k1,k2;
bool v[100005];
double kk(double p,double q)//p是y 
{
	return p/q;
}
void dfs(double aa,double bb,int setp)//aa是x (当前节点)
{
	for(int i=1;i<=n;i++)
       if(!v[i]&&y[i]>bb&&x[i]>aa)
          if(kk(y[i]-bb,x[i]-aa)<k2&&kk(y[i]-bb,x[i]-aa)>k1)
          {
          	v[i]=1;
          	dfs(x[i],y[i],setp+1);
          	setp--;
          	v[i]=0;
	      }
	maxx=max(maxx,setp);
}
int main()
{
	freopen("asm_second.in","r",stdin);
	freopen("asm_second.out","w",stdout);
	cin>>n;
	cin>>a>>b>>c>>d;
	k1=kk(a,b);//a是y 
	k2=kk(c,d);
	for(int i=1;i<=n;i++)
	   cin>>x[i]>>y[i];
	dfs(0,0,0);
	cout<<maxx;
}