Submit solution

Points:
7 (partial)

Time limit:
0.6s

Memory limit:
32M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

points are placed in the coordinate plane.

Write a program that calculates how many ways we can choose three points so that they form a **right**
triangle with **legs** parallel to the coordinate axes.

A right triangle has one -degree internal angle. The legs of a right triangle are its two shorter sides.

#### Input Specification

The first line of input contains the integer , the number of points. Each of the following lines contains two integers and , the coordinates of one point.

No pair of points will share the same pair of coordinates.

#### Output Specification

Output the number of triangles.

#### Scoring

In of all test cases, will be less than .

In of all test cases, will be less than .

#### Sample Input 1

```
3
4 2
2 1
1 3
```

#### Sample Output 1

`0`

#### Sample Input 2

```
5
1 2
2 1
2 2
2 3
3 2
```

#### Sample Output 2

`4`

#### Sample Input 3

```
6
10 10
20 10
10 20
20 20
30 20
30 30
```

#### Sample Output 3

`8`

## Comments