#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

typedef pii point;
typedef pair<point,point> ls;

const int maxn=8e5+10;

const int BSZ=800;
int bid[maxn],bl[maxn/BSZ+10],br[maxn/BSZ+10],mxb,hptr[maxn/BSZ+10],rez[maxn];
vector<int>hull[maxn/BSZ+10];
int n;
pair<point,int> a[maxn];
ls qry[maxn];

point operator -(point a,point b){
    return {a.ff-b.ff,a.ss-b.ss};
}

bool operator < (ls a,ls b){
    a.ss = a.ss-a.ff;
    b.ss = b.ss-b.ff;
    ll ret = (ll)a.ss.ff*b.ss.ss-(ll)a.ss.ss*b.ss.ff;
    if(ret<0)return true;
    return false;
}

void goblock(int x){

    for(int i=bl[x];i<=br[x];i++){
        while(hull[x].size()>1 && !(ls(a[hull[x][hull[x].size()-2]].ff,a[hull[x].back()].ff)<
                                    ls(a[hull[x][hull[x].size()-2]].ff,a[i].ff) ) ) hull[x].pop_back();
        hull[x].pb(i);
    }
    hptr[x]=0;
}
void build_sqrt(){

    int l=1;
    int r=BSZ;
    mxb=0;
    while(l<=n){
        r=min(r,n);

        for(int i=l;i<=r;i++){
            bid[i]=mxb;
        }
        bl[mxb]=l;
        br[mxb]=r;

        l+=BSZ;
        r+=BSZ;
        mxb++;
    }

    for(int i=0;i<mxb;i++){
        goblock(i);
    }

}

bool lscmp(int a,int b){
    return qry[a]<qry[b];
}

int brute(int l,int r,ls line){
    for(int i=l;i<=r;i++){
        if(line<ls(line.ff,a[i].ff))continue;
        return a[i].ss;
    }
    return -1;
}
int roro(int l,int r,ls line){

    if(l>r)return -1;
    for(int i=l;i<=r;i++){

        while(hptr[i]+1<hull[i].size() &&
              !(line<ls(a[hull[i][hptr[i]]].ff,a[hull[i][hptr[i]+1]].ff)) )hptr[i]++;

        if(line<ls(line.ff,a[ hull[i][hptr[i]] ].ff))continue;
        return a[hull[i][hptr[i]] ].ss;
    }
    return -1;
}
int go(int l,int r, ls line){

    int lid=bid[l];
    int rid=bid[r];
    if(lid==rid){
        return brute(l,r,line);
    }
    else{

        int ret=-1;
        ret=max(ret,brute(l,br[lid],line));
        ret=max(ret,brute(bl[rid],r,line));

        ret=max(ret, roro(lid+1,rid-1,line));

        return ret;
    }
    return -1;
}

int main(){

    ///freopen("test.txt","r",stdin);

    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d %d",&a[i].ff.ff,&a[i].ff.ss);
        a[i].ss=i;
    }
    sort(a+1,a+n+1);

    build_sqrt();

    vector<int>indq;
    int q;
    scanf("%d",&q);
    for(int i=0;i<q;i++){
        scanf("%d %d %d %d",&qry[i].ff.ff,&qry[i].ff.ss,&qry[i].ss.ff,&qry[i].ss.ss);
        if(qry[i].ff>qry[i].ss)swap(qry[i].ff,qry[i].ss);
        indq.pb(i);
    }
    sort(indq.begin(),indq.end(),lscmp);


    for(int i=0;i<q;i++){
        int id=indq[i];
        int l=1;
        int r=n;
        int L=n+1;
        int sr;
        while(l<=r){
            sr=(l+r)/2;
            if(a[sr].ff.ff>=qry[id].ff.ff){
                L=sr;
                r=sr-1;
            }
            else l=sr+1;
        }
        l=1;
        r=n;
        int R=0;
        while(l<=r){
            sr=(l+r)/2;
            if(a[sr].ff.ff<=qry[id].ss.ff){
                R=sr;
                l=sr+1;
            }
            else r=sr-1;
        }

        if(L>R){
            rez[id]=-1;
            continue;
        }

        ///printf("%d %d AAA\n",L,R);
        rez[id]=go(L,R,qry[id]);
    }

    for(int i=0;i<q;i++)printf("%d\n",rez[i]);

    return 0;
}