#include <bits/stdc++.h>
using namespace std;
#define N 816666
#define fi first
#define se second
typedef pair<int,int> pii;
#define mp make_pair
int n,ix[N];pii p[N];
#define SZ 300099
#define x1 xx1
#define y1 yy1
#define x2 xx2
#define y2 yy2
typedef long long ll;
int m,x1[SZ],y1[SZ],x2[SZ],y2[SZ],l[SZ],r[SZ];
struct fx {
__int128 fz; ll fm;
void cl() {
    if(fm<0) fz=-fz,fm=-fm;
}
};
bool operator < (fx a,fx b) {
    a.cl(),b.cl();
    return a.fz*(__int128)b.fm<b.fz*(__int128)a.fm;
}
bool operator >= (fx a,fx b) {
    return !(a<b);
}
fx operator + (fx a,fx b) {
    auto g=a.fm/__gcd(a.fm,b.fm)*b.fm;
    fx c;
    c.fz=a.fz*(g/a.fm)+b.fz*(g/b.fm);
    c.fm=g;
    return c;
}
int ans[SZ];
struct Line {
mutable ll k,m; mutable fx p; mutable int id;
bool operator < (const Line&o) const {return k<o.k;}
bool operator < (const fx& x) const {return p<x;}
};
struct LC:multiset<Line,less<>> {
    static const ll inf=4e18;//LLONG_MAX;
    fx div(ll a,ll b) {
        fx s{a,b};s.cl();return s;
    }
    bool isect(iterator x,iterator y) {
        if(y==end()) return x->p=fx{inf,1},0;
        if(x->k==y->k) x->p=x->m>y->m?fx{inf,1}:fx{-inf,1};
        else x->p=div(y->m-x->m,x->k-y->k);
        return x->p>=y->p;
    }
    void add(ll k,ll m,int id) {
        // cerr<<"id="<<id<<"++\n";
        auto z=insert({k,m,fx{0,1},id}),y=z++,x=y;
        while(isect(y,z)) z=erase(z);
        if(x!=begin()&&isect(--x,y)) isect(x,y=erase(y));
        while((y=x)!=begin()&&(--x)->p>=y->p)
            isect(x,erase(y));
    }
    pair<fx,int> query(fx s) {
        if(empty()) return mp(fx{0,1},-1);
        auto l=*lower_bound(s);
        return make_pair(fx{l.k*s.fz+l.m*s.fm,s.fm},l.id);
    }
};
const int B=25000;
void deal(LC&s,int i) {
    if(ans[i]!=-1) return;
    fx k{y2[i]-y1[i],x2[i]-x1[i]};
    auto w=s.query(k);
    if(w.se!=-1) {
        k.fz*=x1[i]; k.fz-=y1[i]*k.fm;
        w.fi=w.fi+k;
        w.fi.cl();
        // cerr<<"haha"<<w.se<<"\n";
        if(ans[i]==-1&&w.fi.fz>=0)
            ans[i]=w.se;
    }
}
int ts[SZ],tn;
void fz(int l,int r,int ql,int qr) {
    if(ql>qr||l==r) return;
    int m=(l+r)>>1;
    // sort by r
    sort(ts+ql,ts+1+qr,[&](int x,int y) {
        return ::r[x]<::r[y];
    });
    int S=ql;
    while(S<=qr&&::r[ts[S]]<=m) ++S;
    fz(l,m,ql,S-1); ql=S;
    if(ql>qr) return;
    sort(ts+ql,ts+1+qr,[&](int x,int y) {
        return ::l[x]<::l[y];
    });
    S=qr;
    while(S>=ql&&::l[ts[S]]>m) --S;
    fz(m+1,r,S+1,qr); qr=S;
    if(ql>qr) return;
    {
    LC s;
    for(int j=m;j>=l&&S>=ql;--j) {
        s.add(-p[j].fi,p[j].se,ix[j]+1);
        while(S>=ql&&max(::l[ts[S]],l)==j) {
            deal(s,ts[S]);
            --S;
        }
    }
    }
    sort(ts+ql,ts+1+qr,[&](int x,int y) {
        return ::r[x]<::r[y];
    });
    S=ql;
    {
    LC s;
    for(int j=m+1;j<=r&&S<=qr;++j) {
        s.add(-p[j].fi,p[j].se,ix[j]+1);
        while(S<=qr&&min(::r[ts[S]],r)==j) {
            deal(s,ts[S]);
            ++S;
        }
    }
    }
}
int main() {
    scanf("%d",&n);
    for(int i=0;i<n;++i)
        scanf("%d%d",&p[i].fi,&p[i].se),ix[i]=i;
    stable_sort(ix,ix+n,[&](int x,int y) {return p[x]<p[y];});
    stable_sort(p,p+n);
    scanf("%d",&m);
    for(int i=1;i<=m;++i) {
        scanf("%d%d%d%d",x1+i,y1+i,x2+i,y2+i);
        if(x1[i]>x2[i])
            swap(x1[i],x2[i]),swap(y1[i],y2[i]);
        l[i]=lower_bound(p,p+n,pii(x1[i],0))-p;
        r[i]=lower_bound(p,p+n,pii(x2[i]+1,0))-p-1;
        ans[i]=-1;
    }
    for(int L=0;L<n;L+=B) {
        int R=min(L+B,n)-1;
        {
        LC s;
        for(int j=L;j<=R;++j) {
            s.add(-p[j].fi,p[j].se,ix[j]+1);
        }
        tn=0;
        for(int i=1;i<=m;++i) if(ans[i]!=-1);
        else if(l[i]<=L&&R<=r[i]) {
            deal(s,i);
        }
        else {
            int pp=max(L,l[i]);
            int qq=min(R,r[i]);
            // l[i]=pp, r[i]=qq;
            if(pp<=qq) {
                if(qq-pp<=3) {
                    LC ss;
                    for(int j=pp;j<=qq;++j) {
                        ss.add(-p[j].fi,p[j].se,ix[j]+1);
                    }
                    deal(ss,i);
                }
                else ts[tn++]=i;
            }
        }
        }
        fz(L,R,0,tn-1);
    }
    for(int i=1;i<=m;++i) {
        // printf("%lld/%lld ",ans[i].fi.fz,ans[i].fi.fm);
        int u=ans[i];
        printf("%d\n",u);
    }
}
/*
1
1 5
1
1 5 1 5
*/