#include<bits/stdc++.h>

using namespace std;

int a[10001],b[10001],g[10001],k[10001];

const int N=1e5+10;

int maxn[10005][10005];

int main()
{
    int n;
    cin>>n; 
    for(int i=1;i<=n;i++)
    {
        cin>>a[i]>>b[i]>>g[i]>>k[i];

        for(int c=b[i];c<=k[i];c++)
        {
           for(int j=a[i];j<=g[i];j++)
           {
               maxn[c][j]=i;
           }
        }
        
    }

    int x,y;
    cin>>x>>y;
    if(maxn[y][x]!=0)
      cout<<maxn[y][x]<<endl;
    else 
      cout<<"-1"<<endl;
    return 0;
}