#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());

const int N = 1e5;
struct KdTree{
  int D;
  typedef int T;
  typedef vector<T> Point;
  struct Node{
    int idx, axis;
    Node *LN, *RN;
  };
  Node* p;
  vector<Point> pl;
  vector<int> idxs;
  Node* _build(const int il, const int ir, const int d){
    if(ir <= il) return nullptr;
    int m = (il+ir)/2;
    nth_element(idxs.begin()+il, idxs.begin()+m, idxs.begin()+ir, [&](int l, int r){return pl[l][d] < pl[r][d];});
    Node* node = new Node();
    node->idx = idxs[m];
    node->axis = d;
    node->LN = _build(il, m, (d+1)%D);
    node->RN = _build(m+1, ir, (d+1)%D);
    return node;
  }
  void build(vector<Point> &v){
    pl = v;
    D = sz(v[0]);
    FOR(i, 0, sz(pl)) idxs.pb(i);
    p = _build(0, sz(pl), 0);
  }
  void _query(const Node *node, const Point &L, const Point &R, vector<int> &v){
    if (node == nullptr) return;
    int idx = node->idx, axis = node->axis;
    FOR(i, 0, D) if(pl[idx][i] < L[i] || R[i] < pl[idx][i]) goto no;
    v.pb(idx);
no: ;
    if(L[axis] <= pl[idx][axis]) _query(node->LN, L, R, v);
    if(pl[idx][axis] <= R[axis]) _query(node->RN, L, R, v);
  }
  void query(const Point &L, const Point &R, vector<int> &v){
    _query(p, L, R, v);
  }
} kdt;
int n, q;
VV<int> x;
V<int> L(2), R(2), v;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  x.resize(n);
  FOR(i, 0, n){
    FOR(j, 0, 2){
      int a;
      cin >> a;
      x[i].pb(a);
    }
  }
  kdt.build(x);
  cin >> q;
  FOR(i, 0, q){
    cin >> L[0] >> R[0] >> L[1] >> R[1];
    v.clear();
    kdt.query(L, R, v);
    sort(all(v));
    for(int a:v) printf("%d\n", a);
    printf("\n");
  }
}


Measured memory_bytes: 73280