Given \textbf{n} distinct points on the plane. Required to find a number of different non-degenerate rectangles whose vertices are the given points. Note that the parties sought rectangles may not be parallel to the axes. \InputFile In the first line of the input file contains the number \textbf{n} (\textbf{1} ≤ \textbf{n} ≤ \textbf{4063}). Followed by \textbf{n} pairs of integers (\textbf{x_i}, \textbf{y_i}) (\textbf{0} ≤ \textbf{x_i}, \textbf{y_i} ≤ \textbf{32000}). \OutputFile Derive the output file a single number - the number of the desired rectangle.