#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<cmath>
using namespace std;
struct N{
	double x,y;
}a[100100];
int n;
double ai,b,c,d;
int f[100100];
int ans;
int len;
int bi(N a,N b)
{
	if (a.x<b.x) return 1;
	if (a.x>b.x) return 0;
	if (a.y<b.y) return 1;
	return 0;
}
bool pan(int x)
{
	int k=a[x].y/a[x].x;
	if (k>ai/b&&k<c/d)
	 return true;
	return false;
}
void dfs(int x)
{
	for (int i=x+1;i<=n;i++)
	{
		if (pan(i))
		{
			len++;
			dfs(i);
		}
    }
}
int main()
{
	freopen("asm_second.in","r",stdin);
	freopen("asm_second.out","w",stdout);
	cin>>n;
	cin>>ai>>b>>c>>d;
	for (int i=1;i<=n;i++)
	cin>>a[i].x>>a[i].y;
	sort(a+1,a+1+n,bi);
	for (int i=1;i<=n;i++)
	{
		int k=a[i].y/a[i].x;
		if (k>ai/b&&k<c/d)
		{
			len=1;
	     	dfs(i);
	     	ans=max(ans,len);
	    }
	}
	cout<<ans;
	return 0;
}