#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace::std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
// random_device rd;
// mt19937 mt(rd());
// #include <boost/numeric/interval.hpp>
// #include <boost/numeric/interval/io.hpp>
// #include <boost/intrusive/rbtree.hpp>
// #include <boost/geometry.hpp>
// #include <boost/geometry/geometries/linestring.hpp>
// #include <boost/geometry/geometries/polygon.hpp>
// #include <boost/geometry/geometries/point_xy.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cfloat;
// typedef mp::cpp_int cint;

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
template<typename T=long long>using pbds=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<typename T=long long>using pqueue =__gnu_pbds::priority_queue<T, less<T>,rc_binomial_heap_tag>;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
//#define PI 3.141592653589793
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"");if(i>INF/2)cout<<"INF";else cout<<i;f=1;}cout<<"\n";}while(0)
#define output2(v) for(auto j:v)output(j);
#define _output(v) do{bool f=0;rep(i,v.size()){cout<<(f?" ":"");if(v[i]>INF/2)cout<<"INF";else cout<<v[i];f=1;}cout<<"\n";}while(0)
#define _output2(v) rep(j,v.size()){_output(v[j]);}
#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define SUM(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define LINF 9223372036854775807
#define MOD 100000007
#define endl "\n"
template<typename T=lint>T in(){return *istream_iterator<T>(cin);}
inline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}
template<typename T=lint>inline T lcm(T a,T b){return a/gcd(a,b)*b;}
template<typename T=lint>inline T add(T a,T b){return a+b;}
template<typename T=lint>inline T minq(T a,T b){return min(a,b);}
inline bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
inline bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};

unsigned long rnd() {
	static unsigned long x=123456789, y=362436069, z=521288629, w=88675123;
	unsigned long t=(x^(x<<11));
	x=y; y=z; z=w;
	return ( w=(w^(w>>19))^(t^(t>>8)) );
}
template<typename T=lint,int sz=2>
struct kdtree{
    typedef array<T,sz> Point;
    Point point;
    //vector<Point> v;
	lint v_size;
    int axis,depth;
    kdtree *l=nullptr,*r=nullptr;
    kdtree(vector<Point> v=vector<Point>{},int depth=0):v_size(v.size()),depth(depth){
        build(v,depth);
    }
    inline bool comp(const Point& s,const Point& t){
        rep(i,sz)if(s[i]>t[i])return 0;
        return 1;
    }
    inline void build(vector<Point> v,const int& depth){
        if(v_size==0)return;
        axis=depth%tuple_size<Point>::value;
        sort(all(v),[this](const auto s,const auto t){return s[this->axis]<t[this->axis];});
        point=v[v.size()/2];
        vector<Point> lv(v.size()/2),rv(v.size()-v.size()/2);
        rep(i,lv.size())lv[i]=v[i];
    	rep(i,rv.size())rv[i]=v[i+lv.size()];
        if(lv.size()&&v.size()!=1)l=new kdtree(lv,depth+1);
        if(rv.size()&&v.size()!=1)r=new kdtree(rv,depth+1);
    }
	void insert(Point p){
        //v.push_back(p);
		v_size++;
        if(v_size==1){
            return;
        }
        if(p[axis]<point[axis]){
            if(!l)l=new kdtree(vector<Point>{p},depth+1);
            else l->insert(p);
        }else{
            if(!r)r=new kdtree(vector<Point>{p},depth+1);
            else r->insert(p);
        }
    }
	vector<Point> search(const Point& lp,const Point& rp){
        if(v_size==1&&comp(lp,point)&&comp(point,rp))return vector<Point>{point};
        vector<Point> res;
        if(r&&point[axis]<=rp[axis]){
            res=r->search(lp,rp);
        }
        if(l&&lp[axis]<=point[axis]){
            vector<Point> tmp=l->search(lp,rp);
			res.insert(res.end(),all(tmp));
        }
        return res;
    }
};
int main(){
	int n;
	cin>>n;
	vector<array<int,2>> v(n);
	map<array<int,2>,int>idx;
	rep(i,n)cin>>v[i][0]>>v[i][1];
	rep(i,n)idx[v[i]]=i;
	kdtree<int,2> kd(v);
	int q;
	cin>>q;
	rep(i,q){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		auto l=array<int,2>{a,c};
		auto r=array<int,2>{b,d};
		auto da=kd.search(l,r);
		vector<int> ans(da.size());
		rep(i,da.size()){
			ans[i]=idx.at(da[i]);
		}
		sort(all(ans));
		rep(i,ans.size()){
			cout<<ans[i]<<endl;
		}
		cout<<endl;
	}
}


Measured memory_bytes: 105644