#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}
impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}
impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                if len == 0 {
                    break;
                }
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

struct Point {
    orig_index: usize,
    x: i32,
    y: i32,
}

#[derive(Debug)]
struct Node {
    point_index: usize,
    left: Option<usize>,
    right: Option<usize>,
}

fn make_tree(
    depth: usize,
    nodes: &mut Vec<Node>,
    points: &mut Vec<Point>,
    l: usize,
    r: usize,
) -> Option<usize> {
    if !(l < r) {
        return None;
    }

    if depth % 2 == 0 {
        points[l..r].sort_by_key(|p| p.x);
    } else {
        points[l..r].sort_by_key(|p| p.y);
    }

    let node_index = nodes.len();
    let mid = (l+r)/2;
    nodes.push(Node { point_index: mid, left: None, right: None }); 
    nodes[node_index].left = make_tree(depth+1, nodes, points, l, mid);
    nodes[node_index].right = make_tree(depth+1, nodes, points, mid+1, r);
    Some(node_index)
}

fn find(
    depth: usize,
    node_index: usize,
    points: &[Point],
    nodes: &[Node],
    sx: i32,
    tx: i32,
    sy: i32,
    ty: i32,
    out: &mut Vec<usize>
) {
    let node = &nodes[node_index];
    let p = &points[node.point_index];

    if sx <= p.x && p.x <= tx && sy <= p.y && p.y <= ty {
        out.push(p.orig_index);
    }
    // println!("{:?}", node);
    if depth % 2 == 0 {
        if node.left.is_some() && sx <= p.x {
            find(depth+1, node.left.unwrap(), points, nodes, sx, tx, sy, ty, out);
        }
        if node.right.is_some() && p.x <= tx {
            find(depth+1, node.right.unwrap(), points, nodes, sx, tx, sy, ty, out);
        }
    } else {
        if node.left.is_some() && sy <= p.y {
            find(depth+1, node.left.unwrap(), points, nodes, sx, tx, sy, ty, out);
        }
        if node.right.is_some() && p.y <= ty {
            find(depth+1, node.right.unwrap(), points, nodes, sx, tx, sy, ty, out);
        }
    }
}

fn solve() {
    input! {
        n: usize,
        points: [(i32,i32); n],
        q: usize,
        queries: [(i32,i32,i32,i32); q],
    }
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    let mut points = points.into_iter()
        .enumerate()
        .map(|(i, (x,y))| Point {
            orig_index: i,
            x: x,
            y: y,
        }).collect();
    let mut nodes = vec![];
    make_tree(0, &mut nodes, &mut points, 0, n);
    assert_eq!(nodes.len(), n);

    for &qu in &queries {
        let (sx, tx, sy, ty) = qu;
        let mut v = vec![];
        find(0, 0, &points, &nodes, sx, tx, sy, ty, &mut v);

        v.sort();
        for &x in &v {
            writeln!(out, "{}", x).unwrap();
        }
        writeln!(out, "").unwrap();
    }
}


Measured memory_bytes: 40444