Wet Shark and Bishops

Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right.

Wet Shark thinks that two bishops attack each other if they share the same diagonal. Note, that this is the only criteria, so two bishops may attack each other (according to Wet Shark) even if there is another bishop located between them. Now Wet Shark wants to count the number of pairs of bishops that attack each other.

Input

The first line of the input contains n (1 ≤ n ≤ 200 000) — the number of bishops.

Each of next n lines contains two space separated integers x_i and y_i (1 ≤ x_i, y_i ≤ 1000) — the number of row and the number of column where i-th bishop is positioned. It's guaranteed that no two bishops share the same position.

Output

Output one integer — the number of pairs of bishops which attack each other.

Example

Input

5
1 1
1 5
3 3
5 1
5 5

Output

6

Input

3
1 1
2 3
3 5

Output

0

Note

In the first sample following pairs of bishops attack each other: (1, 3), (1, 5), (2, 3), (2, 4), (3, 4) and (3, 5). Pairs (1, 2), (1, 4), (2, 5) and (4, 5) do not attack each other because they do not share the same diagonal.

题意：认为各条主对角线和副对角线上的点两两有关系，问整个坐标方格内，有关联的点有几对。

思路：各主对角线上点的横纵坐标所存在的关系为：

            同一条对角线上横坐标X减纵坐标Y的差值相同；

           各副对角线上点的横纵坐标所存在的关系为：

            同一条对角线上横坐标X加纵坐标Y的和相同；

PS：如果有N各点，则N个点之间两两有N*（N-1）/2种关系。（排列组合）

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int n,x,y;
    scanf("%d",&n);
    int mal[2005],del[2005];
    memset(mal,0,sizeof(mal));
    memset(del,0,sizeof(del));
    for(int i=0;i<n;i++){
        scanf("%d %d",&x,&y);
        del[x-y+1000]++;///各条主对角线点分类
        mal[x+y]++;///各条副对角线点的分类
    }
    int sum=0;
    for(int i=1;i<=2000;i++)
    {
        if(mal[i]>1)
            sum+=mal[i]*(mal[i]-1)/2;
        if(del[i]>1)
            sum+=del[i]*(del[i]-1)/2;
    }
    printf("%d\n",sum);
    return 0;
}