//  Created by conan1024hao in 2019.
//  Copyright © 2019 conan1024hao. All rights reserved.
//  専用ライブラリです、自由にコピーして構いません。
//  感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define INF 10e16
#define MOD 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll>P;
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b)  {return a/GCD(a,b)*b;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll cmp(pair<ll,string>a,pair<ll,string> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se<b.se;
}

//---------------------------------------------------------------------------
class Node{//树结点的构造
public:
int location,l,r,p;//左右父节点
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);
}
};

static const int NIL = -1;
static const int MAX =1000010;
int N;
Point Po[MAX];
Node T[MAX];
int np;

bool lessX(const Point &p1,const Point &p2){return p1.x<p2.x;}//结点按照x排序
bool lessY(const Point &p1,const Point &p2){return p1.y<p2.y;}//结点按照y排序

int maketree(int l,int r,int depth){//递归构造二叉树
if(l>=r)return NIL;
int mid = (l+r)/2;
int t = np++;

if(depth%2==0)//按层给x和y交替排序构成二叉树
sort(Po+l,Po+r,lessX);//按照x排序
else sort(Po+l,Po+r,lessY);//按照y排序

T[t].location = mid;
T[t].l = maketree(l,mid,depth+1);
T[t].r = maketree(mid+1,r,depth+1);

return t;
}

void find(int v,int sx,int tx,int sy,int ty,int depth,vector<Point> &ans){//寻找范围内的点
int x = Po[T[v].location].x;
int y = Po[T[v].location].y;

if(sx<=x&&x<=tx&&sy<=y&&y<=ty)
ans.push_back(Po[T[v].location]);

if(depth%2==0){//按x和y分层的构造方式,采取对应的分层查找方法
if(T[v].l!=NIL&&x>=sx)
find(T[v].l,sx,tx,sy,ty,depth+1,ans);
if(T[v].r!=NIL&&x<=tx)
find(T[v].r,sx,tx,sy,ty,depth+1,ans);
}
else{
if(T[v].l!=NIL&&y>=sy)
find(T[v].l,sx,tx,sy,ty,depth+1,ans);
if(T[v].r!=NIL&&y<=ty)
find(T[v].r,sx,tx,sy,ty,depth+1,ans);
}
}
//---------------------------------------------------------------------------
int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------
    int x,y;
    scanf("%d", &N);
    for(int i=0;i<N;i++){
    scanf("%d %d", &x, &y);
    Po[i] = Point(i,x,y);
    T[i].l = T[i].r = T[i].p = NIL;
    }

    np = 0;
    int root = maketree(0,N,0);
    //printf("%d%d\n",root,P[T[root].location]);
    int n;
    scanf("%d", &n);
    int sx,tx,sy,ty;
    vector<Point> result;

    for(int j=0;j<n;j++){
    scanf("%d %d %d %d",&sx,&tx,&sy,&ty);
    result.clear();
    find(root,sx,tx,sy,ty,0,result);
    sort(result.begin(),result.end());
    for(int i=0;i<result.size();i++)
    result[i].print();
    printf("\n");
    }
    //-------------------------------
    return 0;
}
//---------------------------------------------------------------------------



Measured memory_bytes: 16488