Description

Given a set of points with integer coordinates xi, yi, i = 1...N, your program must find all the squares having each of four vertices in one of these points.

Input

Input file contains integer N followed by N pairs of integers xi yi.
Constraints
-10^4 ≤ xi, yi ≤ 10^4, 1 ≤ N ≤ 2000. All points in the input are different.

Output

Output file must contain a single integer ― number of squares found.

Sample Input

Sample input 1
4
0 0 4 3 -3 4 1 7
Sample input 2
9
1 1  1 2  1 3
2 1  2 2  2 3
3 1  3 2  3 3

Sample Output

Sample output 1
1
Sample output 2
6

HINT

Bold texts appearing in the sample sections are informative and do not form part of the actual data.

Source

Northeastern Europe 2005, Far-Eastern Subregion