Count the squares

All submissions for this problem are available.
Everyone knows what a square looks like. Mathematically, a square is a regular quadrilateral. This means that it has four equal sides and four equal angles (90 degree angles).
One beautiful day, Johnny eagerly examined the interesting properties of squares. He did not forget you, his best friend and a talented programmer and thus made a problem about squares to challenge your programming ability. The problem is: given a set of N points in the plane, how many squares are there such that all their corners belong to this set?
Now let's show Johnny your skill!
Input
The first line contains t, the number of test cases (about 10). Then t test cases follow.
Each test case has the following form:
 The first line contains an integer N, the number of points in the given set (4 ≤ N ≤ 500).
 Then N lines follow, each line contains two integers X, Y describing coordinates of a point (50 ≤ X, Y ≤ 50).
Output
For each test case, print in a single line the number of squares that have vertices belong to the given set.
Example
Input:
1
7
0 0
0 1
1 0
1 1
1 2
2 1
2 2
Output:
3
Output details:
The three squares are:
(0 0), (0 1), (1 1), (1 0)
(1 1), (1 2), (2 2), (2 1)
(0 1), (1 0), (2 1), (1 2)
Author:  admin 
Tags  admin 
Date Added:  28052009 
Time Limit:  0.655556 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 