#include<iostream>
#include<cstdio>

using namespace std;
int n;

int tmp;
struct node
{
	int a,b,x,y;
};
node re[10001];
bool find(int,int,int,int,int,int);
int p,q;

int main()
{
	freopen("carpet.in","r",stdin);
	freopen("carpet.out","w",stdout);
	scanf("%d",&n);
	for(int i=1; i<=n; i++)
	{
		scanf("%d%d%d%d",&re[i].a,&re[i].b,&re[i].x,&re[i].y);
	}
	scanf("%d%d",&p,&q);
	for(int i=n; i>=1; i--)
	{
		if(find(p,q,re[i].a,re[i].b,re[i].x,re[i].y))
		{
			tmp=i;
			cout<<tmp;
			break;
		}
	}
	if(tmp==0) cout<<-1;
}

bool find(int x,int y,int a,int b,int c,int d)
{
	if((x>=a&&x<=a+c)&&(y>=b&&y<=b+d))
	return 1;
	else return 0;
}