Problem:
Score : 400 points

Problem Statement

On a two-dimensional plane, there are N red points and N blue points.
The coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).

A red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.

At most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.

Constraints

All input values are integers.

1 \leq N \leq 100

0 \leq a_i, b_i, c_i, d_i < 2N

a_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.

b_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.

Input

Input is given from Standard Input in the following format:

N
a_1 b_1
a_2 b_2
:
a_N b_N
c_1 d_1
c_2 d_2
:
c_N d_N

Output

Print the maximum number of friendly pairs.

Sample Input 1

3
2 0
3 1
1 3
4 2
0 4
5 5

Sample Output 1

2

For example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).

Sample Input 2

3
0 0
1 1
5 2
2 3
3 4
4 5

Sample Output 2

2

For example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).

Sample Input 3

2
2 2
3 3
0 0
1 1

Sample Output 3

0

It is possible that no pair can be formed.

Sample Input 4

5
0 0
7 3
2 2
4 8
1 6
8 5
6 9
5 4
9 1
3 7

Sample Output 4

5

Sample Input 5

5
0 0
1 1
5 5
6 6
7 7
2 2
3 3
4 4
8 8
9 9

Sample Output 5

4

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[derive(Clone, Debug)]
struct Point {
    x: i32,
    y: i32
}

fn main() {
    let n = read();
    let mut reds = Vec::new();
    let mut blues = Vec::new();
    for _ in 0..n {
        let v = read_line();
        reds.push( Point{x: v[0], y: v[1]} )
    }
    for _ in 0..n {
        let v = read_line();
        blues.push( Point{x: v[0], y: v[1]} )
    }

    // Rule
    // red.x < blue.x
    // and
    // red.y < blue.y
    reds.sort_by(|a, b| (a.x + a.y).abs().cmp(&(b.x + b.y).abs()));
    blues.sort_by(|a, b| (a.x + a.y).abs().cmp(&(b.x + b.y).abs()));
    
    let mut best = 0;
    let mut cnt = 0;
    let copy_blues = blues.clone();
    for _ in 0..n as usize {
        let tmp = reds.remove(0);
        reds.push(tmp);
        for i in 0..reds.len() as usize {
            for j in 0..blues.len() as usize {
                if reds[i].x < blues[j].x && reds[i].y < blues[j].y {
                    cnt += 1;
                    blues.remove(j);
                    break;
                }
            }
        }
        best = std::cmp::max(best, cnt);
        blues = copy_blues.clone();
        cnt = 0;
    }

    // for i in 0..reds.len() as usize {
    //     for j in 0..blues.len() as usize {
    //         if reds[i].x < blues[j].x && reds[i].y < blues[j].y {
    //             cnt += 1;
    //             blues.remove(j);
    //             break;
    //         }
    //     }
    // }

    // let mut cnt2 = 0;
    // let mut blues = copy_blues;
    // reds.sort_by(|a, b| a.y.cmp(&b.y));
    // blues.sort_by(|a, b| a.y.cmp(&b.y));
    // for i in 0..reds.len() as usize {
    //     for j in 0..blues.len() as usize {
    //         if reds[i].x < blues[j].x && reds[i].y < blues[j].y {
    //             cnt2 += 1;
    //             blues.remove(j);
    //             break;
    //         }
    //     }
    // }

    // cnt = std::cmp::max(cnt, cnt2);
    println!("{}", best);
}

fn read() -> i32 {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_line() -> Vec<i32> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let v = s.trim()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect();
    return v
}