Sereja has painted n distinct points on the plane. The coordinates of each point are integers. Now he is wondering: how many squares are there with sides parallel to the coordinate axes and with points painted in all its four vertexes? Help him, calculate this number.
输入描述:
The first line contains integer n(1 ≤ n ≤ 105). Each of the next n lines contains two integers xi, yi(0 ≤ xi, yi ≤ 105), the integers represent the coordinates of the i-th point. It is guaranteed that all the given points are distinct.
输出描述:
In a single line print the required number of squares.
示例1
输入
5<br />0 0<br />0 2<br />2 0<br />2 2<br />1 1<br />9<br />0 0<br />1 1<br />2 2<br />0 1<br />1 0<br />0 2<br />2 0<br />1 2<br />2 1<br />
加载中...