#include <iostream>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cstring>
#include <algorithm>
using namespace std;

struct node
{
	int xi,yi;
	int ui,vi;
};
const int maxn=100000+2;
node a[maxn];

int n,xl,yl,xr,yr,t;

int main()
{
	//freopen("test.in","r",stdin);
	//freopen("test.out","w",stdout);
	freopen("camera.in","r",stdin);
	freopen("camera.out","w",stdout);
	
	scanf("%d%d%d%d%d",&n,&xl,&yl,&xr,&yr);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&a[i].xi,&a[i].yi,&a[i].ui,&a[i].vi);
	}
	int max1=0;
	for(int i=1;i<=n;i++)//shi ke
	{
		int m=0;
		for(int j=1;j<=n;j++)//dian
		{
			a[j].xi+=a[j].ui;
			a[j].yi+=a[j].vi;
			if(a[j].xi>=xl && a[j].xi<=xr && a[j].yi>=yl && a[j].yi<=yr)
			{
				m++;
			}
		}	
		if(m>max1)
		{
			max1=m;
			t=i;
		}
	}
	cout<<t<<endl;
	return 0;
}