#include<bits/stdc++.h>
using namespace std;
using ll =long long;
struct vec{
    int x,y;
    bool operator<(const vec a)const {
        return x<a.x;
    }
    ll operator ^(const vec a)const {
        return 1ll*x*a.y-1ll*y*a.x;
    }
    vec operator -(const vec a)const {
        return {x-a.x,y-a.y};
    }
};
bool mem2;
pair<vec,int> grass[800010];int ls[300010],rs[300010];
int yl[300010],yr[300010];
int xl[300010],xr[300010];
int ans[300010];int hull[800010],ed[800010];
bool mem1;
void solve(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int x,y;cin>>x>>y;
        grass[i]={{x,y},i};
    }
    sort(grass,grass+n);
    // for(int i=0;i<n;i++)    cerr<<grass[i].first.x<<' '<<grass[i].first.y<<'\n';
    int m;cin>>m;
    for(int i=1;i<=m;i++){
        int x1,y1,x2,y2;
        cin>>x1>>y1>>x2>>y2;
        if(x1>x2)   swap(x1,x2),swap(y1,y2);
        ls[i]=partition_point(grass,grass+n,[&](pair<vec,int> w){return w.first.x<=x1;})-grass;
        rs[i]=partition_point(grass,grass+n,[&](pair<vec,int> w){return w.first.x<=x2;})-grass-1;
        yl[i]=y1,yr[i]=y2;
        xl[i]=x1,xr[i]=x2;
    }
    int base=0;
    while((1<<base)<n)  base++;
    for(int lx=base;lx>=0;lx--){
        int len=(1<<lx);
        for(int lo=0,ro;lo<n;lo=ro+1){
            ro=min(lo+len-1,n-1);
            int tot=lo;
            for(int i=lo;i<=ro;i++){
                while(tot-lo>=2&&((grass[i].first-grass[hull[tot-1]].first)^(grass[i].first-grass[hull[tot-2]].first))<=0) tot--;
                hull[tot++]=i;
            }
            ed[lo]=tot-1;
        }
        for(int i=1;i<=m;i++){
            if(ls[i]<=rs[i]&&ans[i]==0){
                for(auto j:{(ls[i]+(len-1))/len*len,(rs[i]-len+1)/len*len}){
                    if(j>=ls[i]&&j+len-1<=rs[i]){
                        int lo=j,ro=ed[j];
                        while(lo<ro){
                            int mid=(lo+ro)>>1;
                            if(((grass[hull[mid+1]].first-grass[hull[mid]].first)^vec(xr[i]-xl[i],yr[i]-yl[i]))<=0)   lo=mid+1;
                            else ro=mid;
                        }
                        if(((grass[hull[lo]].first-vec(xl[i],yl[i]))^(vec(xr[i]-xl[i],yr[i]-yl[i])))<=0)    ans[i]=grass[hull[lo]].second+1;
                    }
                }
            }
        }
    }
    for(int i=1;i<=m;i++){
        cout<<(ans[i]?ans[i]:-1)<<'\n';
    }


}
signed main(){
    ios::sync_with_stdio(0),cin.tie(0);
    // cout<<(&mem2-&mem1)/1024./1024.<<'\n';
    int _ =1;
    while(_--)  solve();

}