/*----description------------
双向图，可以使k条边的权值为零，求s到t的最短路

---------------------------- */
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<cstring>
#define M  10050
using namespace std;
int a[M],b[M],x[M],y[M];

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