In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A,B) such that

- Point A and Point B do not coincide.
- Manhattan Distance and the Euclidean Distance between the points should be equal.

Note : Pair of 2 points(A,B) is considered same as Pair of 2 points(B ,A).

Manhattan Distance = |x2-x1|+|y2-y1|

Euclidean Distance = ((x2-x1)^2 + (y2-y1)^2)^0.5 where points are (x1,y1) and (x2,y2).

**Input:**

First Line Consist of T - number of test cases.

For each Test case:-

First Line consist of N , Number of points

Next line contains N pairs contains two integers Xi and Yi i.e, X coordinate and the Y coordinate of a Point

**Output:**

Print the number of pairs as asked above.

**Constraints:**

1<=T <= 50

1<=N <= 2*10 ^ 5

0<=(|Xi|, |Yi| ) <= 10^9

**Example:**

**Sample Input : **

```
1
2
1 1
7 5
```

**Sample Output :**

`0`

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

highway_to_hell | 54 |

thecoducer | 53 |

geekscoder | 53 |

SaurabhSihag | 52 |

yashranjan74 | 50 |

Pulkit__Sharma__ | 806 |

Anirban166 | 682 |

Found_me | 636 |

abducodes | 607 |

Sathvik Avasarala | 526 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.