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.

Examples

Input

3
1 1
5 1
5 5


Output

1


Input

2
10 10
20 20


Output

0


Input

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


Output

16
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.HashSet;
import java.util.NoSuchElementException;

public class Main {
    private static FastScanner sc = new FastScanner();
    static Node[] V;
    static long size = 0;

    public static void main(String[] args) {
    	int n = sc.nextInt();
    	Point[] p = new Point[n];
    	for(int i=0; i<n; i++) {
    		p[i] = new Point(sc.nextInt(), sc.nextInt());
    	}
    	Arrays.sort(p, (a, b) -> a.x == b.x ? a.y - b.y :a.x - b.x);

    	V = new Node[100001];
    	int lastx = -1;
    	int lasty = -1;
    	for(int i=0; i<n; i++) {
    		if(V[p[i].y] == null) {
    			Node no = new Node();
    			no.y = p[i].y;
    			no.x.add(p[i].x);
    			V[p[i].y] = no;
    		} else {
    			V[p[i].y].x.add(p[i].x);
    		}
    		if(p[i].x == lastx) {
    			V[p[i].y].nbr.add(lasty);
    			V[lasty].nbr.add(p[i].y);
    		}
    		lastx = p[i].x;
    		lasty = p[i].y;
    	}
    	long ans = 0;
    	for(int i=0; i<100001; i++) {
    		if(V[i] == null) continue;
    		HashSet<Integer> xa = new HashSet<>();
    		size = 0;
    		if(!V[i].vst) V[i].dfs(xa);
    		ans += (long)size * xa.size();
    	}
    	System.out.println(ans - n);
    }

    static class Point{
    	int x;
    	int y;
		public Point(int x, int y) {
			this.x = x;
			this.y = y;
		}
    }

    static class Node {
        HashSet<Integer> nbr = new HashSet<>();
        int y;
        HashSet<Integer> x = new HashSet<>();
        boolean vst = false;
        void dfs(HashSet<Integer> xa) {
        	vst = true;
        	size++;
        	for(int xx : x) {
        		xa.add(xx);
        	}
        	for(int i : nbr) {
        		if(!V[i].vst) {
        			V[i].dfs(xa);
        		}
        	}
        }
    }

    static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;
        private boolean hasNextByte() {
            if(ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch(IOException e) {
                    e.printStackTrace();
                }
                if(buflen <= 0) {
                    return false;
                }
            }
            return true;
        }
        private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
        private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
        private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
        public boolean hasNext() { skipUnprintable(); return hasNextByte();}
        public String next() {
            if (!hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while(isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public int nextInt(){
            return Integer.parseInt(next());
        }
        public double nextDouble(){
            return Double.parseDouble(next());
        }
    }
}
