Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

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-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/05/2020 21:12:54 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|