//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
ll x[500500],y[500500];
ll v1[500500],v2[500500],v3[500500],v4[500500];
ll bit[500500];
void update(int p,ll v)
{
	while(p<500500)
	{
		bit[p]+=v;
		p+=(p&(-p));
	}
}
ll query(int p)
{
	ll ans=0;
	while(p)
	{
		ans+=bit[p];
		p-=(p&(-p));
	}
	return ans;
}
void solve(ll *V1,ll *V2)
{
	memset(bit,0,sizeof(bit));
	int p=0;
	vector<int> vind;
	for(int i=1;i<=n;i++)
		vind.pb(i);
	sort(ALL(vind),[&](int u,int v){return y[u]<y[v];});
	for(auto ind:vind)
	{
		while(p<sz(vind)&&y[vind[p]]<y[ind])
		{
			update(x[vind[p]],1);
			p++;
		}
		V1[ind]=query(x[ind]-1);
		V2[ind]=query(n)-query(x[ind]);
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	vector<ll> px,py;
	for(int i=1;i<=n;i++)
	{
		cin>>x[i]>>y[i];
		ll a=x[i]+y[i];
		ll b=x[i]-y[i];
		x[i]=a;
		y[i]=b;
		px.pb(a);
		py.pb(b);
	}
	srt(px);
	uni(px);
	srt(py);
	uni(py);
	for(int i=1;i<=n;i++)
	{
		x[i]=ub(px,x[i]);
		y[i]=ub(py,y[i]);
	}
	solve(v1,v2);
	for(int i=1;i<=n;i++)
		y[i]=sz(py)+1-y[i];
	solve(v3,v4);
	ll ans=1ll*n*(n-1)*(n-2)/6;
	for(int i=1;i<=n;i++)
		ans-=v1[i]*v4[i]+v2[i]*v3[i];
	cout<<ans<<'\n';
	return 0;
}