J - *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.

题意：有n个象，只能斜着走，共享一条对角线的象可以互相攻击，问有多少对可以互相攻击的象；

输入一个n代表象的个数，接下来n行代表象的坐标；

思路：思维题，找出在同一对角线的象的坐标的关系即可；

'/ ',这种的对角线上象的坐标关系为y-x的值是相同的；

'\',这种的对角线的象的坐标关系为y+x的只是相同的；

由于x,y的值是0~1000的，所以要加上1000；

分别统计在不同对角线同一值的个数想加即可；

在同一对角线的对数即为个数(p*(p-1))/2;

下面附上代码：

#include<bits/stdc++.h>
using namespace std;
const int N=20005;
int a[N],b[N];
int main()
{
	int n,p,q;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		scanf("%d %d",&p,&q);
		a[p+q]++;
		b[p-q+1000]++;
	}
	int ans=0;
	for(int i=0;i<=N;i++)
	{
		if(a[i])
			ans+=(a[i]*(a[i]-1))/2;
		if(b[i])
			ans+=(b[i]*(b[i]-1))/2;
	}
	cout<<ans<<endl;
	return 0;
}