use std::cmp::max;

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut members: Vec<(usize, usize)> = vec![];
    for _ in 0..n {
        let mut ab = String::new();
        std::io::stdin().read_line(&mut ab).ok();
        let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        members.push((ab[0], ab[1]));
    }
    let mut m = String::new();
    std::io::stdin().read_line(&mut m).ok();
    let m: usize = m.trim().parse().unwrap();
    let mut max_val = 0;
    //明太子 => Mentaiko...
    let mut mentaiko: Vec<usize> = vec![0; m+1];
    for i in 1..=m {
        let mut xy = String::new();
        std::io::stdin().read_line(&mut xy).ok();
        let xy: Vec<usize> = xy.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let x = xy[0];
        let y = xy[1];
        let count = members.iter().filter(|member| member.0 >= x && y >= member.1).count();
        max_val = max(max_val, count);
        mentaiko[i] = count;
    }

    if max_val == 0 {
        println!("{}", 0);
    } else {
        mentaiko.iter().enumerate()
            .filter(|m| *m.1 == max_val)
            .map(|pair| pair.0)
            .for_each(|i| {
                println!("{}", i);
            });
    }
}