#include<bits/stdc++.h> using namespace std; int main(){ int n,x,y,bj=0; int a[10005],b[10005],g[10005],k[10005]; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]>>b[i]>>g[i]>>k[i]; } cin>>x>>y; for(int i=n;i>=1;i--){ if(x>=a[i]&&x<=a[i]+g[i]&&y>=b[i]&&y<=b[i]+k[i]){ cout<<i; bj=1; break; } } if(bj==0){ cout<<"-1"; } return 0; }

#include <iostream>
using namespace std;

const int MAX_N = 10005;
int n;
int a[MAX_N],b[MAX_N],l[MAX_N],w[MAX_N];

int main()
{
  cin>>n;
  for(int i = 0;i<n;i++)
  {
    cin>>a[i]>>b[i]>>l[i]>>w[i];
  }
  int x,y;
  cin>>x>>y;
  int ans = -1;
  for(int i = n-1;i>=0;--i)
  {
    if (x >= a[i] && x <= a[i] + l[i] && y >= b[i] && y <= b[i] + w[i]) {
            ans = i + 1;
            break;
        }
    }
    cout << ans << endl;
    return 0;
}

#include<stdio.h>
int main()
{
  int n=0;
  scanf("%d",&n);
  int a[n],b[n],j[n],k[n];
  for(int i=1;i<=n;i++){
    scanf("%d %d %d %d",&a[i],&b[i],&j[i],&k[i]);
  }
  int x,y;
  scanf("%d %d",&x,&y);
  int mun=0;
  for(int i=1;i<=n;i++){
    if(a[i]<=x&&y>=b[i]&&x<=a[i]+j[i]&&y<=b[i]+k[i]){
      if(i>=mun){
        mun=i;
      }
      }
    }
  if(mun==0){
    printf("-1");
  }else{
    printf("%d",mun);
  }
  return 0;
}

#include<bits/stdc++.h> using namespace std; int main(){ int n,a[10005] ,b[10005],g[10005],k[10005],x,y; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]>>b[i]>>g[i]>>k[i]; } cin>>x>>y; for(int i=n;i>=1;i--) { if(x>=a[i]&&x<=a[i]+g[i]&&y>=b[i]&&y<=b[i]+k[i]) { cout<<i; return 0; } } cout<<"-1"; return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ int a[10005],b[10005],g[10005],k[10005]; int n,x,y,bj=0; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]>>b[i]>>g[i]>>k[i]; } cin>>x>>y; for(int i=n;i>=1;i--){ if(x >= a[i] && x <= a[i] + g[i] && y >= b[i] && y <= b[i] + k[i]){ cout<<i; bj=1; break; } } if(bj==0){ cout<<-1; } return 0; }