No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Sereja and Squares

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputSereja 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.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 10^{5}). Each of the next *n* lines contains two integers *x*_{i}, *y*_{i} (0 ≤ *x*_{i}, *y*_{i} ≤ 10^{5}), the integers represent the coordinates of the *i*-th point. It is guaranteed that all the given points are distinct.

Output

In a single line print the required number of squares.

Examples

Input

5

0 0

0 2

2 0

2 2

1 1

Output

1

Input

9

0 0

1 1

2 2

0 1

1 0

0 2

2 0

1 2

2 1

Output

5

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/08/2021 23:15:25 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|