#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int Number;
struct NODE
{
	int a,b,x,y;
}A[10005];
int tox,toy;
int main()
{
//	freopen("1.in","r",stdin);
	freopen("carpet.in","r",stdin);
	freopen("carpet.out","w",stdout);
	scanf("%d",&Number);
	for(int i=1;i<=Number;i++)scanf("%d%d%d%d",&A[i].a,&A[i].b,&A[i].x,&A[i].y);
	scanf("%d%d",&tox,&toy);
	int T=-1;
	for(int i=1;i<=Number;i++)
	{
		int a,b,x,y;
		a=A[i].a;
		b=A[i].b;
		x=A[i].x;
		y=A[i].y;
		if((tox>=a)&&(tox<=a+x)&&(toy>=b)&&(toy<=b+y))
		{
			T=i;
		}
	}
	cout<<T<<endl;
}