#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

class Node {
public :
	int location;
	int p, l, r;
	Node() {};
};

class Point {
public:
	int id, x, y;
	Point() {};
	Point(int id, int x, int y) :id(id), x(x), y(y) {};
	bool operator < (const Point &p) const {
		return id < p.id;
	}

	void print(){
		printf("%d\n", id);
	}

};

const int maxx = 1000010;
const int NIL = -1;

Point p[maxx];
Node T[maxx];
vector<Point> A;
int n,q,np=0;

bool cxddx(Point xx, Point yy){
	return xx.x<yy.x;
}
bool cxddy(Point xx, Point yy){
	return xx.y<yy.y;
}

int makekdtree(int left,int right,int depth){
	if(left>=right) return NIL;
	int mid = (left+right)/2;
	int t=np++;
	if(depth%2==0){
		sort(p+left,p+right,cxddx);
	}
	else{
		sort(p+left,p+right,cxddy);
	}
	T[t].location=mid;
	T[t].l=makekdtree(left,mid,depth+1);
	T[t].r=makekdtree(mid+1,right,depth+1);
	return t;
}

void find(int v,int sx,int sy,int tx,int ty,int depth){
	int x=p[T[v].location].x,y=p[T[v].location].y;
	if(sx<=x && sy<=y && tx>=x && ty>=y){
		A.push_back(p[T[v].location]);
	}
	if(depth%2==0){
		if(T[v].l!=NIL){
			if(sx<=x) find(T[v].l,sx,sy,tx,ty,depth+1);
		}
		if(T[v].r!=NIL){
			if(tx>=x) find(T[v].r,sx,sy,tx,ty,depth+1);
		}
	}
	else{
		if(T[v].l!=NIL){
			if(sy<=y) find(T[v].l,sx,sy,tx,ty,depth+1);
		}
		if(T[v].r!=NIL){
			if(ty>=y) find(T[v].r,sx,sy,tx,ty,depth+1);
		}
	}
	return ;
}

int main(){
	int x,y;
	scanf("%d", &n);
	for(int i=0;i<n;i++){
		scanf("%d %d", &x, &y);
		p[i] = Point(i, x, y);
		T[i].l = T[i].r = T[i].p = NIL;
	}
	int root=makekdtree(0,n,0);
	
	scanf("%d", &q);
	int sx,sy,tx,ty;
	while(q--){
		scanf("%d %d %d %d", &sx, &tx, &sy, &ty);
		A.clear();
		find(root,sx,sy,tx,ty,0);
		sort(A.begin(),A.end());
		int len=A.size();
		for(int i=0;i<len;i++) A[i].print();
		cout<<endl;
	}
	return 0;
}
