// {{{ header
#include <bits/stdc++.h>
using namespace std;

using i8   = int8_t;
using u8   = uint8_t;
using i16  = int16_t;
using u16  = uint16_t;
using i32  = int32_t;
using u32  = uint32_t;
using i64  = int64_t;
using u64  = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

using f32  = float;
using f64  = double;
using f80  = __float80;
using f128 = __float128;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'000LL;

constexpr i64 MOD = 1'000'000'007LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

// {{{ util
#define FOR(i, start, end) for(i64 i = (start), i##_end=(end); i < i##_end; ++i)
#define REP(i, n) FOR(i, 0, n)

#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(begin(cccc), end(cccc), ## __VA_ARGS__); })(c))
#define SLICE(f,c,l,r,...) (([&](decltype((c)) cccc, decltype((l)) llll, decltype((r)) rrrr) {\
    auto iiii = llll <= rrrr ? begin(cccc)+llll : end(cccc);\
    auto jjjj = llll <= rrrr ? begin(cccc)+rrrr : end(cccc);\
    return (f)(iiii, jjjj, ## __VA_ARGS__);\
})(c,l,r))

bool is_odd (i64 x) { return x % 2 != 0; }
bool is_even(i64 x) { return x % 2 == 0; }

template<typename T> i64 cmp(T x, T y) { return (y<x) - (x<y); }
template<typename T> i64 sgn(T x) { return cmp(x, T(0)); }

// Haskell の divMod と同じ
pair<i64,i64> divmod(i64 a, i64 b) {
    i64 q = a / b;
    i64 r = a % b;
    if((b>0 && r<0) || (b<0 && r>0)) {
        --q;
        r += b;
    }
    return make_pair(q,r);
}

i64 div_ceil(i64 a, i64 b) {
    i64 q = a / b;
    i64 r = a % b;
    if((b>0 && r>0) || (b<0 && r<0))
        ++q;
    return q;
}

i64 div_floor(i64 a, i64 b) {
    return divmod(a,b).first;
}

i64 modulo(i64 a, i64 b) {
    return divmod(a,b).second;
}

template<typename T, typename U>
bool chmax(T& xmax, const U& x) {
    if(xmax < x) {
        xmax = x;
        return true;
    }
    else {
        return false;
    }
}

template<typename T, typename U>
bool chmin(T& xmin, const U& x) {
    if(x < xmin) {
        xmin = x;
        return true;
    }
    else {
        return false;
    }
}

template<typename InputIt>
auto SUM(InputIt first, InputIt last) {
    using T = typename iterator_traits<InputIt>::value_type;
    return accumulate(first, last, T());
}

template<typename ForwardIt, typename UnaryOperation>
ForwardIt transform_self(ForwardIt first, ForwardIt last, UnaryOperation op) {
    return transform(first, last, first, op);
}

template<typename T>
void RD(T& x) {
    cin >> x;
#ifdef PROCON_LOCAL
    assert(cin);
#endif
}

template<typename T>
void RD(vector<T>& v, i64 n) {
    v.reserve(n);
    REP(_, n) {
        T e; RD(e);
        v.emplace_back(e);
    }
}

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
    for(auto first = begin(v), it = first; it != end(v); ++it) {
        if(it != first)
            out << ' ';
        out << *it;
    }
    return out;
}

template<typename T1, typename T2>
ostream& operator<<(ostream& out, const pair<T1,T2>& p) {
    return out << '(' << p.first << ',' << p.second << ')';
}

void PRINT() {}

template<typename T, typename... TS>
void PRINT(const T& x, const TS& ...args) {
    cout << x;
    if(sizeof...(args)) {
        cout << ' ';
        PRINT(args...);
    }
}

template<typename... TS>
void PRINTLN(const TS& ...args) {
    PRINT(args...);
    cout << '\n';
}

template<typename T>
void DBG_IMPL(i64 line, const char* expr, const T& value) {
#ifdef PROCON_LOCAL
    cerr << "[LINE " << line << "]: ";
    cerr << expr << " = " << value << "\n";
#endif
}

#define DBG(expr) DBG_IMPL(__LINE__, #expr, (expr))
// }}}

// {{{ init
struct ProconInit {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;

    ProconInit() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(IOS_PREC);
#ifdef PROCON_LOCAL
        cerr << fixed << setprecision(IOS_PREC);
#endif
        if(AUTOFLUSH)
            cout << unitbuf;
    }
};
// }}}

//--------------------------------------------------------------------

#define GENERIC(f) ([](auto&&... args) -> decltype(auto) { return (f)(forward<decltype(args)>(args)...); })

template<typename BF, typename UF>
auto ON(BF bf, UF uf) {
    return [bf,uf](const auto& x, const auto& y) {
        return bf(uf(x), uf(y));
    };
}

struct Point {
    i64 id;
    i64 x;
    i64 y;
};

ostream& operator<<(ostream& out, const Point& p) {
    return out << p.id;
}

struct XYTree {
    static constexpr i64 NIL = -1;

    struct Node {
        Point p;
        i64 l;
        i64 r;
    };

    vector<Node> nodes_;
    i64 root_;

    explicit XYTree(vector<Point>& ps) {
        nodes_.reserve(ps.size());
        root_ = init(begin(ps), end(ps), 0);
    }

    template<typename RandomIt>
    i64 init(RandomIt first, RandomIt last, i64 depth) {
        if(first >= last) return NIL;

        auto f = [depth](const Point& p) {
            return is_even(depth) ? p.x : p.y;
        };
        sort(first, last, ON(less<>(),f));

        auto mid = first + (last-first)/2;  // mid < last が成立
        i64 l = init(first, mid, depth+1);
        i64 r = init(mid+1, last, depth+1);
        nodes_.emplace_back(Node { *mid, l, r });
        return nodes_.size() - 1;
    }

    vector<Point> find(i64 sx, i64 tx, i64 sy, i64 ty) {
        vector<Point> res;
        search(res, root_, sx, tx, sy, ty, 0);
        return res;
    }

    void search(vector<Point>& res, i64 v, i64 sx, i64 tx, i64 sy, i64 ty, i64 depth) {
        const Node& node = nodes_[v];
        i64 x = node.p.x;
        i64 y = node.p.y;

        if(sx <= x && x <= tx && sy <= y && y <= ty)
            res.emplace_back(node.p);

        if(is_even(depth)) {
            if(node.l != NIL && sx <= x) search(res, node.l, sx, tx, sy, ty, depth+1);
            if(node.r != NIL && x <= tx) search(res, node.r, sx, tx, sy, ty, depth+1);
        }
        else {
            if(node.l != NIL && sy <= y) search(res, node.l, sx, tx, sy, ty, depth+1);
            if(node.r != NIL && y <= ty) search(res, node.r, sx, tx, sy, ty, depth+1);
        }
    }
};

i64 N;
vector<Point> PS;

void solve() {
    XYTree tree(PS);

    i64 Q; RD(Q);
    REP(_, Q) {
        i64 sx,tx; RD(sx); RD(tx);
        i64 sy,ty; RD(sy); RD(ty);
        vector<Point> ans = tree.find(sx,tx,sy,ty);
        ALL(sort, ans, ON(less<>(), [](const Point& p) { return p.id; }));
        ALL(for_each, ans, GENERIC(PRINTLN));
        PRINTLN();
    }
}

signed main() {
    RD(N);
    PS.reserve(N);

    REP(i, N) {
        i64 x,y; RD(x); RD(y);
        PS.emplace_back(Point { i, x, y });
    }

    solve();

    return 0;
}



Measured memory_bytes: 33196