#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#define MAX 500000
#define NIL -1
using namespace std;
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);
    }
};
class Node{
public:
    int location,l,r;
    Node(){}
};
Point p[MAX];
Node T[MAX];
int n,q,np;
vector<Point>ans;
bool lessX(const Point &p1,const Point &p2){return p1.x<p2.x;}
bool lessY(const Point &p1,const Point &p2){return p1.y<p2.y;}
int make2DTree(int l,int r,int depth){
    if(l>=r)return NIL;
    int mid=(l+r)/2;
    int t=np++;
    if(depth%2==0)
        sort(p+l,p+r,lessX);
    else
        sort(p+l,p+r,lessY);
    T[t].location=mid;
    T[t].l=make2DTree(l,mid,depth+1);
    T[t].r=make2DTree(mid+1,r,depth+1);
    return t;
}
void find(int u,int sx,int tx,int sy,int ty,int depth){
    int i=T[u].location;
    if(sx<=p[i].x && p[i].x<=tx && sy<=p[i].y && p[i].y<=ty)
        ans.push_back(p[i]);
    if(depth%2==0){
        if(T[u].l!=NIL)
            if(sx<=p[i].x)find(T[u].l,sx,tx,sy,ty,depth+1);
        if(T[u].r!=NIL)
            if(p[i].x<=tx)find(T[u].r,sx,tx,sy,ty,depth+1);
    }
    else{
        if(T[u].l!=NIL)
            if(sy<=p[i].y)find(T[u].l,sx,tx,sy,ty,depth+1);
        if(T[u].r!=NIL)
            if(p[i].y<=ty)find(T[u].r,sx,tx,sy,ty,depth+1);
    }
}
int main()
{
    int x,y,sx,tx,sy,ty;
    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 = NIL;
    }
    np=0;
    make2DTree(0,n,0);
    scanf("%d",&q);
    for(int i=0;i<q;i++)
    {
        scanf("%d%d%d%d",&sx,&tx,&sy,&ty);
        ans.clear();
        find(0,sx,tx,sy,ty,0);
        //int len=ans.size();
        sort(ans.begin(),ans.end());
        for(vector<Point>::iterator it = ans.begin();it!=ans.end();it++)
            it->print();
        cout<<endl;
    }
    return 0;
}
