Problem:
Score : 600 points

Problem Statement

There are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).

We will repeat the following operation as long as possible:

Choose four integers a, b, c, d (a \neq c, b \neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.

We can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.

Constraints

1 \leq N \leq 10^5

1 \leq x_i, y_i \leq 10^5

If i \neq j, x_i \neq x_j or y_i \neq y_j.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
:
x_N y_N

Output

Print the maximum number of times we can do the operation.

Sample Input 1

3
1 1
5 1
5 5

Sample Output 1

1

By choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.

Sample Input 2

2
10 10
20 20

Sample Output 2

0

There are only two dots, so we cannot do the operation at all.

Sample Input 3

9
1 1
2 1
3 1
4 1
5 1
1 2
1 3
1 4
1 5

Sample Output 3

16

We can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \leq i,j \leq 5), and no more. Thus, the maximum number of operations is 16.

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

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*);
    }
}

#[allow(unused_imports)]
use std::cmp::{min, max};

#[allow(unused_imports)]
use std::io::Write;

fn dfs(edges: &Vec<Vec<usize>>, cur: usize, par:usize, root:usize, g: &mut Vec<usize>) {
    g[cur] = root;
    for &node in edges[cur].iter() {
        if node != par {
            dfs(edges, node, cur, root, g);
        }
    }
}


fn main() {
    input!{
      n: usize,
      xys: [(usize, usize); n],
    }
    use std::collections::HashMap;
    let mut xs: Vec<_> = xys.iter().map(|v|v.0).collect();
    xs.sort();
    xs.dedup();
    let xs: HashMap<_, _> = xs.into_iter().enumerate().map(|(i, v)| (v, i)).collect();

    let mut ys: Vec<_> = xys.iter().map(|v|v.1).collect();
    ys.sort();
    ys.dedup();
    let ys: HashMap<_, _> = ys.into_iter().enumerate().map(|(i, v)| (v, i)).collect();

    let xn = xs.len();
    let yn = ys.len();
    let m = xn+yn;
    let mut edges = vec![vec![]; m];
    for &(x, y) in xys.iter() {
         let a = xs[&x];
         let b = ys[&y] + xn;
         edges[a].push(b);
         edges[b].push(a);
    }

    // let mut grp = vec![m; m];
    // for i in 0..m {
    //     if grp[i] == m {
    //         dfs(&edges, i, m, i, &mut grp);
    //     }
    // }
    // let mut grp2: Vec<_> = grp.iter().cloned().collect();
    // grp2.sort();
    // grp2.dedup();
    // let mut g_nodes = vec![vec![]; grp2.len()];
    // for &(x, y) in xys.iter() {
    //      let a = xs[&x];
    //      let g = grp2.binary_search(&grp[a]).unwrap();
    //      g_nodes[g].push((x, y));
    // }
    // // debug!(g_nodes);

    // let mut ans = 0u64;
    // for nodes in g_nodes {
    //     let mut xs: Vec<_> = nodes.iter().map(|v|v.0).collect();
    //     xs.sort();
    //     xs.dedup();
    //     let mut ys: Vec<_> = nodes.iter().map(|v|v.1).collect();
    //     ys.sort();
    //     ys.dedup();
    //     ans += xs.len() as u64 * ys.len() as u64;
    // }
    // println!("{}", ans-n as u64);
}