#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
//#define double long double

const int maxn = 810000;
const int maxq = 310000;

int n,m;
struct point
{
	int x,y,id;
	friend inline point operator +(const point &k1,const point &k2) { return (point){k1.x+k2.x,k1.y+k2.y,0}; }
	friend inline point operator -(const point &k1,const point &k2) { return (point){k1.x-k2.x,k1.y-k2.y,0}; }
}h[maxn];
ll cross(const point &k1,const point &k2){ return (ll)k1.x*k2.y-(ll)k1.y*k2.x; }

struct query
{
	point l,r;
	int qi;
}q[maxq];
int ans[maxq];

vector<int>V;
int t[maxn],tp;
void solve(const int l,const int r,const int Vd,const int Vu)
{
	if(Vd>Vu) return;
	if(l==r)
	{
		for(int Vi=Vd;Vi<=Vu;Vi++)
		{
			int i=V[Vi];
			int id=q[i].qi;
			
			if( cross( h[l]-q[i].l,q[i].r-q[i].l )<=0 ) ans[id]=h[l].id;
		}
		return;
	}
	
	tp=0;
	for(int i=l;i<=r;i++)
	{
		while(tp>1 && cross(h[t[tp]]-h[t[tp-1]], h[i]-h[t[tp]])>=0) tp--;
		t[++tp]=i;
	}
	for(int Vi=Vd;Vi<=Vu;Vi++)
	{
		int i=V[Vi];
		if(q[i].l.x<h[l].x && q[i].r.x>h[r].x)
		{
			//binary_search
			int L=1,R=tp-1;
			while(L<=R)
			{
				int LR=(L+R)>>1;
				if( cross(q[i].r-q[i].l, h[t[LR+1]]-h[t[LR]]) <=0 ) R=LR-1;
				else L=LR+1;
			}
			R++;
			
			int j=t[R];
			int id=q[i].qi;
			if( cross( h[j]-q[i].l, q[i].r-q[i].l ) <=0 ) ans[id]= h[j].id;
		}
	}
	
	const int mid=(l+r)>>1;
	{
		int nexd=Vd;
		vector<int>Vr;
		for(int Vi=Vd;Vi<=Vu;Vi++)
		{
			int i=V[Vi];
			if(q[i].l.x<h[l].x && q[i].r.x>h[r].x)
			{
				Vr.push_back(i);
			}
			else
			{
				if(q[i].l.x<=h[mid].x) V[nexd++]=i;
				else Vr.push_back(i);
			}
		}
		solve(l,mid,Vd,nexd-1);
		
		for(int j=0;j<(int)Vr.size();j++)
		{
			V[nexd+j]=Vr[j];
		}
	}
	{
		int nexu=Vu;
		vector<int>Vl;
		for(int Vi=Vu;Vi>=Vd;Vi--)
		{
			int i=V[Vi];
			if(q[i].l.x<h[l].x && q[i].r.x>h[r].x)
			{
				Vl.push_back(i);
			}
			else
			{
				if(q[i].r.x>=h[mid+1].x) V[nexu--]=i;
				else Vl.push_back(i);
			}
		}
		solve(mid+1,r,nexu+1,Vu);
		
		for(int j=0;j<(int)Vl.size();j++)
		{
			V[nexu-j]=Vl[j];
		}
	}
}

signed main()
{
	/////////////////////////////////////////////////
	//freopen("tmp.in","r",stdin);
	ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>h[i].x>>h[i].y;
		h[i].id=i;
	}
	sort(h+1,h+n+1,[&](const point &k1,const point &k2){return k1.x<k2.x;} );
	
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>q[i].l.x>>q[i].l.y;
		cin>>q[i].r.x>>q[i].r.y;
		q[i].qi=i;
		if(q[i].l.x > q[i].r.x) swap(q[i].l,q[i].r);
	}
	
	for(int i=1;i<=m;i++) if( !(q[i].l.x==q[i].r.x || q[i].r.x<h[1].x || q[i].l.x>h[n].x) )
		V.push_back(i);
	for(int i=1;i<=m;i++) ans[i]=-1;
	solve(1,n,0,V.size()-1);
	
	for(int i=1;i<=m;i++) cout<<ans[i]<<'\n';
	
	return 0;
}