eolymp
bolt
Try our new interface for solving problems
Problems

Rectangles-1

Rectangles-1

Time limit 8 seconds
Memory limit 64 MiB

Given 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.

Input data

In the first line of the input file contains the number n (1n4063). Followed by n pairs of integers (x_i, y_i) (0x_i, y_i32000).

Output data

Derive the output file a single number - the number of the desired rectangle.

Examples

Input example #1
4
0 0
1 2
1 0
0 2
Output example #1
1