#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <string>
#include <climits>
#include <cassert>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>
#include <cmath>
#include <random>

#define LEN(x) int(x.size())
#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) ((uint64_t)bit & ((uint64_t)1 << (uint64_t)i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;  // 1,073,741,824
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;


class Node {
public:
    int location;
    int parent;
    int left;   // 左のノードのindex
    int right;  // 右のノードのindex

    Node() {}
    Node(int parent, int left, int right) : parent(parent), left(left), right(right) {}
};

class Point {
public:
    int id;
    long long x;
    long long y;

    Point() {}

    Point(int id, long long x, long long y) : id(id), x(x), y(y) {}

    bool operator<(const Point &p) const {
        return id < p.id;
    }
};

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; }

class KDTree {
    static const int NIL = -1;
    const int N;
    std::vector<Point> points;
    std::vector<Node> nodes;
    int node_idx = 0;
    int root;

public:
    // Nは点の数
    KDTree(int N) : N(N) {
    }

    void add_point(int id, long long x, long long y) {
        points.emplace_back(Point(id, x, y));
        nodes.emplace_back(Node(NIL, NIL, NIL));
    }

    // O(N log^2 N)
    void build() {
        this->root = makeKDTree(0, N, 0);
    }

    // x1 <= x <= x2 and y1 <= y <= y2を満たす点を取得
    std::vector<Point> rectangular(long long x1, long long x2, long long y1, long long y2) const {
        assert(x1 <= x2 and y1 <= y2);
        vector<Point> ans;
        this->rectangular(this->root, x1, x2, y1, y2, 0, ans);
        return ans;
    }

    // 点(x, y)を中心とする半径r以内に含まれる点を取得
    std::vector<Point> radius(long long x, long long y, long long r) const {
        vector<Point> ans;
        this->radius(this->root, x, y, r, 0, ans);
        return ans;
    }

    // 点(x, y)に一番近い点を見つける
    int nearest_neighbor(long long x, long long y) {
        return -1;
    }

private:
    // 作成したノード番号を返す
    int makeKDTree(const int l, const int r, const int depth) {
        if (not (l < r)) {
            return NIL;
        }

        if (depth % 2 == 0) {
            sort(points.begin() + l, points.begin() + r, lessX);
        } else {
            sort(points.begin() + l, points.begin() + r, lessY);
        }

        const int mid = (l + r) / 2;
        const int t = node_idx++;
        nodes[t].location = mid;
        nodes[t].left = makeKDTree(l, mid, depth + 1);
        nodes[t].right = makeKDTree(mid + 1, r, depth + 1);

        return t;
    }

    void rectangular(int v, long long x1, long long x2, long long y1, long long y2, int depth, vector<Point> &ans) const {
        const auto x = points[nodes[v].location].x;
        const auto y = points[nodes[v].location].y;

        if (x1 <= x and x <= x2 and y1 <= y and y <= y2) {
            ans.emplace_back(points[nodes[v].location]);
        }

        if (depth % 2 == 0) {
            if (nodes[v].left != NIL and x1 <= x) {
                rectangular(nodes[v].left, x1, x2, y1, y2, depth + 1, ans);
            }
            if (nodes[v].right != NIL and x <= x2) {
                rectangular(nodes[v].right, x1, x2, y1, y2, depth + 1, ans);
            }
        } else {
            if (nodes[v].left != NIL and y1 <= y) {
                rectangular(nodes[v].left, x1, x2, y1, y2, depth + 1, ans);

            }
            if (nodes[v].right != NIL and y <= y2) {
                rectangular(nodes[v].right, x1, x2, y1, y2, depth + 1, ans);
            }
        }
    }

    // not sqrt
    long long euclidean_distance(long long y1, long long x1, long long y2, long long x2) const {
        return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
    }

    void radius(int v, const long long tx, const long long ty, const long long r, const int depth, vector<Point> &ans) const {
        const auto x = points[nodes[v].location].x;
        const auto y = points[nodes[v].location].y;

        if (this->euclidean_distance(y, ty, x, tx) <= r * r) {
            ans.emplace_back(points[nodes[v].location]);
        }

        if (depth % 2 == 0) {
            if ((tx - x) * (tx - x) <= r * r) {
                if (nodes[v].left != NIL) {
                    radius(nodes[v].left, tx, ty, r, depth + 1, ans);
                }
                if (nodes[v].right != NIL) {
                    radius(nodes[v].right, tx, ty, r, depth + 1, ans);
                }
            }
        } else {
            if ((ty - y) * (ty - y) <= r * r) {
                if (nodes[v].left != NIL) {
                    radius(nodes[v].left, tx, ty, r, depth + 1, ans);

                }
                if (nodes[v].right != NIL) {
                    radius(nodes[v].right, tx, ty, r, depth + 1, ans);
                }
            }
        }
    }

};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N;
    cin >> N;

    KDTree kd(N);
    LL X, Y;
    for (int i = 0; i < N; i++) {
        cin >> X >> Y;
        kd.add_point(i, X, Y);
    }
    kd.build();

    int Q;
    cin >> Q;
    int sx, tx, sy, ty;
    FOR(i, 0, Q) {
        cin >> sx >> tx >> sy >> ty;
        auto ans = kd.rectangular(sx, tx, sy, ty);
        sort(ALL(ans));
        FOR(j, 0, LEN(ans)) {
            printf("%d\n", ans[j].id);
        }
        printf("\n");
    }

    return 0;
}


Measured memory_bytes: 22080