Rhombuses#2345
On the coordinate plane, you are given distinct points. A rhombus is defined as a convex quadrilateral with non-zero area, where all sides are of equal length.
Write a program to determine the number of distinct ways to select four points from these given points to form a rhombus. Two ways are considered different if they differ by at least one point.
The first line contains an integer (1 \leq N \leq 300) — the number of points. Each of the next lines contains two integers x_i and y_i (-10^8 \leq x_i, y_i \leq 10^8), the coordinates of a point.
Output a single integer — the number of ways to select four points forming a rhombus.
Example 1