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

struct node
{
	int xi,yi;
	int ui,vi;
};

const int maxn=100000+1;
int n;
int p=0;
int xl,yl,xr,yr;
int max1;
node a[maxn];
int main()
{
	freopen("camera.in","r",stdin);
	freopen("camera.out","w",stdout);
	
	cin>>n;
	cin>>xl>>yl>>xr>>yr;
	for (int i=1; i<=n; i++)
	{
		cin>>a[i].xi>>a[i].yi>>a[i].ui>>a[i].vi;
//		if (a[i].xi>=xl && a[i].yi>=yl && a[i].xi<=xr && a[i].yi<=yr)
//		{
//			f[p]++;
//		}
	}
	for (int i=1; i<=n; i++)//时间 
	{
		int ans=0;
		for (int j=1; j<=n; j++)//点 
		{
			a[j].xi+=a[j].ui;
			a[j].yi+=a[j].vi;
			if (a[j].xi>=xl && a[j].yi>=yl && a[j].xi<=xr && a[j].yi<=yr)
			{
				ans++;
			}
		}
		if (ans>max1)
		{
			max1=ans;
			p=i;
		}
	}
	cout<<p<<endl;
	return 0;
}