#include<bits/stdc++.h>
using namespace std;
int n,m,perm[800010],stk[800010],ans[300010];
struct S_{int x,y;}a[800010];
struct Q_{int i,x1,y1,x2,y2;}q[300010];
auto cmpk=[](Q_ x,Q_ y){
   return (x.y1-x.y2)*1ll*(y.x2-y.x1)<(y.y1-y.y2)*1ll*(x.x2-x.x1);
};
void solve(int L,int R,int l,int r){
   if(l>r)return;
   int p=stable_partition(q+l,q+r+1,[&](Q_ x){return x.x1<=a[perm[L]].x&&a[perm[R]].x<=x.x2;})-q,tp=0;
   for(int k=L;k<=R;k++){
      int u=perm[k];
      for(;tp>1&&(a[stk[tp]].y-a[u].y)*1ll*(a[stk[tp]].x-a[stk[tp-1]].x)<(a[stk[tp-1]].y-a[stk[tp]].y)*1ll*(a[u].x-a[stk[tp]].x);tp--);
      stk[++tp]=u;
   }
   for(int i=l,j=1;i<p;i++){
      for(;j<tp;){
         S_ f=a[stk[j]],g=a[stk[j+1]];
         if((f.y-g.y)*1ll*(q[i].x2-q[i].x1)<(q[i].y1-q[i].y2)*1ll*(g.x-f.x))j++;
         else break;
      }
      int w=stk[j];
      if(q[i].x1==q[i].x2?q[i].y1<=a[w].y&&a[w].y<=q[i].y2:q[i].y1*1ll*(q[i].x2-a[w].x)+q[i].y2*1ll*(a[w].x-q[i].x1)<=a[w].y*1ll*(q[i].x2-q[i].x1))ans[q[i].i]=w;
   }int l0=l;l=p;
   if(L<R){
      int Mid=L+R>>1;
      p=stable_partition(q+l,q+r+1,[&](Q_ x){return x.x1<=a[perm[Mid]].x;})-q-1;
      solve(L,Mid,l,p);
      inplace_merge(q+l,q+p+1,q+r+1,cmpk);
      p=stable_partition(q+l,q+r+1,[&](Q_ x){return x.x2>=a[perm[Mid+1]].x;})-q-1;
      solve(Mid+1,R,l,p);
      inplace_merge(q+l,q+p+1,q+r+1,cmpk);
   }
   inplace_merge(q+l0,q+l,q+r+1,cmpk);
}
int main(){
   scanf("%d",&n);
   for(int i=1;i<=n;i++)scanf("%d%d",&a[i].x,&a[i].y),perm[i]=i;
   sort(perm+1,perm+n+1,[](int x,int y){
      return a[x].x<a[y].x;
   });
   scanf("%d",&m);
   for(int i=1;i<=m;i++){
      scanf("%d%d%d%d",&q[i].x1,&q[i].y1,&q[i].x2,&q[i].y2);
      if(q[i].x1>q[i].x2)swap(q[i].x1,q[i].x2),swap(q[i].y1,q[i].y2);
      q[i].i=i,ans[i]=-1;
   }
   sort(q+1,q+m+1,cmpk);
   solve(1,n,1,m);
   for(int i=1;i<=m;i++)printf("%d\n",ans[i]);
   return 0;
}