#include <cstdio>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <string>

using namespace std;

struct node
{
	int chux,chuy,xfang,yfang;
};
node a[500000+20];

int n,xl,yl,xr,yr;
bool b[5000000+20];
int ans,max1,p;

void dfs(int x);

int main()
{
	freopen("camera.in","r",stdin);
	freopen("camera.out","w",stdout);
	
	cin>>n>>xl>>yl>>xr>>yr;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&a[i].chux,&a[i].chuy,&a[i].xfang,&a[i].yfang);
//		cin>>a[i].chux>>a[i].chuy>>a[i].xfang>>a[i].yfang;
		if(a[i].chux>xr && a[i].xfang>=0)
		{
			b[i]=true;
		}
		else if(a[i].chux<xl && a[i].xfang<=0)
		{
			b[i]=true;
		}
		else if(a[i].chuy>yr && a[i].yfang>=0)
		{
			b[i]=true;
		}
		else if(a[i].chuy<yl && a[i].yfang<=0)
		{
			b[i]=true;
		}
	}
	for(int t=1;t<=20000;t++)
	{
		ans=0;
		for(int i=1;i<=n;i++)
		{
			if(!b[i])
			{
				a[i].chux+=a[i].xfang;
				a[i].chuy+=a[i].yfang;
				if(a[i].chux>=xl && a[i].chux<=xr && a[i].chuy>=yl&& a[i].chuy<=yr)
				{
					ans++;
				}
			}
			if(a[i].chux>xr && a[i].xfang>=0)
			{
				b[i]=true;
			}
			else if(a[i].chux<xl && a[i].xfang<=0)
			{
				b[i]=true;
			}
			else if(a[i].chuy>yr && a[i].yfang>=0)
			{
				b[i]=true;
			}
			else if(a[i].chuy<yl && a[i].yfang<=0)
			{
				b[i]=true;
			}
			
		}
		if(ans>max1)
		{
			max1=ans;
			p=t;
		}
	}
	cout<<p<<endl;
	return 0;
}