#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 998244353;
inline void uadd(int &a, const int &b){ a += b - Mod; a += (a>>31) & Mod; }
inline int add(int a, const int &b){ a += b - Mod; a += (a>>31) & Mod; return a; }
inline void usub(int &a, const int &b){ a -= b; a += (a>>31) & Mod; }
inline int sub(int a, const int &b){ a -= b, a += (a>>31) & Mod; return a; }
inline void umul(int &a, const int &b){ a = (int)(1ll * a * b % Mod); }
inline int mul(const int &a, const int &b){ return (int)(1ll * a * b % Mod); }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p & 1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i - 1], i);
	invfact[n] = qpow(fact[n], Mod - 2); for(int i = n; i > 0; --i) invfact[i - 1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i - 1]);
}
inline int binom(int n, int m){ return mul(fact[n], mul(invfact[m], invfact[n - m])); }

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> inline void chmax(T &_a, const T &_b){ (_b>_a) ? (_a=_b) : _a; }
template<typename T> inline void chmin(T &_a, const T &_b){ (_b<_a) ? (_a=_b) : _a; }

int n, m;
struct vec{
	int x, y;
	vec(){ x = y = 0; }
	vec(int _x, int _y){ x = _x, y = _y; }
};
bool operator < (vec lh, vec rh){
	return lh.x < rh.x;
}
inline vec operator - (vec lh, vec rh){ return vec(lh.x - rh.x, lh.y - rh.y); }
inline ll cross(vec lh, vec rh){ return 1ll * lh.x * rh.y - 1ll * lh.y * rh.x; }
pair<vec, int> p[1111111];
int ql[300300], qr[300300]; vec qs[300300], qt[300300];
int ans[300300];

int h[1111111], cnt, ncnt;

int bl, N, bi;

int getpos(int u){
	int lb = 0, ub = cnt - 1;
	while(lb <= ub){
		int mid = (lb + ub) >> 1;
		if(h[mid] < (u << (bl - bi)))
			lb = mid + 1;
		else 
			ub = mid - 1;
	}
	return lb;
}

void qry(int id, int u){
	int lb = getpos(u), ub = getpos(u + 1) - 2;
	while(lb <= ub){
		int mid = (lb + ub) >> 1;
		if(cross(qt[id] - qs[id], p[h[mid + 1]].first - p[h[mid]].first) <= 0)
			ub = mid - 1;
		else 
			lb = mid + 1;
	}
	if(cross(qt[id] - qs[id], p[h[lb]].first - qs[id]) >= 0) ans[id] = h[lb];
}

int main(){
	//freopen("g.in", "r", stdin);
	//freopen("g.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> p[i].first.x >> p[i].first.y, p[i].second = i;
	sort(p + 1, p + n + 1);

	bl = 0;
	while((1<<bl) < n + 2) ++bl;
	N = (1<<bl);

	cin >> m;
	rep(i, m){
		cin >> qs[i].x >> qs[i].y >> qt[i].x >> qt[i].y;
		if(qs[i].x > qt[i].x) swap(qs[i], qt[i]);
		ql[i] = (int)(lower_bound(p + 1, p + n + 1, make_pair(qs[i], -1)) - p);
		qr[i] = (int)(upper_bound(p + 1, p + n + 1, make_pair(qt[i], 1111111)) - p);
		--ql[i];
		ans[i] = -2;
	}
	rep(i, n) h[i] = i + 1;
	cnt = n;
	for(int i = bl; i > 0; --i){
		bi = i;
		//cout << "----------------- " << i << " -------------------" << endl;
		//rep(j, 1 << i){
		//	cout << j << " " << getpos(j) << " " << getpos(j + 1) << ": ";
		//	for(int k = getpos(j); k < getpos(j + 1); ++k)
		//		cout << h[k] << " (" << p[h[k]].first.x << " " << p[h[k]].first.y << "); ";
		//	cout << endl;
		//}
		rep(j, m) if(ans[j] < 0 && ql[j] + 1 < qr[j]){
			//cout << " qry " << j << ": " << ql[j] << " " << qr[j] << "\n";
			if(ql[j] % 2 == 0) qry(j, ql[j] + 1);
			ql[j] = ql[j] / 2;
			if(qr[j] % 2 == 1) qry(j, qr[j] - 1);
			qr[j] = qr[j] / 2;
		}
		int lst = 0; ncnt = 0;
		for(int j = 0; j < (1 << (i - 1)); ++j){
			//cout << j << endl;
			int lb = lst;
			while(lst < cnt && h[lst] < (j + j + 1) << (bl - i)) ++lst;
			int pl = lst - 1, pr = lst;
			while(lst < cnt && h[lst] < (j + j + 2) << (bl - i)) ++lst;
			int rb = lst - 1;
			//cout << lb << " " << rb << endl;
			while(pl > lb || pr < rb){
				//cout << pl << " " << pr << endl;
				if(pl > lb && cross(p[h[pl]].first - p[h[pl - 1]].first, p[h[pr]].first - p[h[pl - 1]].first) >= 0) --pl;
				else if(pr < rb && cross(p[h[pr]].first - p[h[pl]].first, p[h[pr + 1]].first - p[h[pl]].first) >= 0) ++pr;
				else break;
			}
			//cout << "?????" << endl;
			for(int k = lb; k <= pl; ++k) h[ncnt++] = h[k];
			for(int k = pr; k <= rb; ++k) h[ncnt++] = h[k];
		}
		cnt = ncnt;
	}

	rep(i, m){
		if(ans[i] < 0)
			cout << "-1\n";
		else {
			cout << p[ans[i]].second << "\n";
			//cout << i << ": " << qs[i].x << " " << p[ans[i]].first.x << " " << qt[i].x << endl;
			//assert(p[ans[i]].first.x >= qs[i].x && p[ans[i]].first.x <= qt[i].x && cross(qt[i] - qs[i], p[ans[i]].first - qs[i]) >= 0);
		}
	}

	//cerr << "ok" << endl;

	return 0;
}