## Problem Q1: Stupendous Bowties

There are N (1 ≤ N ≤ 100 000) distinct points on a 2D plane, with the i-th one at integral coordinates (xi, yi) (−109xi ≤ 109, −109yi ≤ 109).

A Fantastic Right Triangle is one which uses 3 of the given points as its vertices, is non-degenerate (i.e., has positive area), and which has both of its legs axis-aligned (one of its two shortest sides is horizontal and the other shortest side is vertical). The vertex at which the two legs of such a triangle meet (which has an interior right angle) is known as the triangle's Spectacular Vertex.

A Stupendous Bowtie consists of an unordered pair of Fantastic Right Triangles which share the same point as their Spectacular Vertex, and which touch only at that point. Count the number of Stupendous Bowties which exist amongst the given points.

For 2 of the 15 marks available, N ≤ 20.
For another 3 of the 15 marks available, N ≤ 200.
For another 2 of the 15 marks available, N ≤ 2000.
For another 3 of the 15 marks available, N ≤ 100 000, −105xi ≤ 105, and −105yi ≤ 105.

### Input Format

The first line of the input contains one integer, N. The remaining N lines each contain two integers, xi and yi for i = 1..N.

### Output Format

Output a single integer, the number of Stupendous Bowties which exist amongst the given points. Note that this value may not fit in a 32-bit signed integer, and may need to be stored in a `long long` / `long` / `int64` variable in C++ / Java / Pascal, respectively.

```12
-3 6
1 6
-1 4
-3 2
1 2
4 2
-4 -3
-3 -3
1 -3
-1 -4
1 -4
-3 -6
```

```8
```

### Explanation

The diagram below illustrates the set of given points (represented by the 12 blue dots), with one of the eight possible Stupendous Bowties shown in red. Point Value: 15 (partial)
Time Limit: 2.00s
Memory Limit: 64M