764K 1375MS
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=10000;
pair<int,int>a[maxn];
int main()
{
int n;
while(scanf("%d",&n)&&n)
{
for(int i=0;i<n;i++) scanf("%d%d",&a[i].first,&a[i].second);
sort(a,a+n);
int ans=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
{
pair<int,int> tmp;
tmp.first=a[i].first+a[i].second-a[j].second;
tmp.second=a[i].second-a[i].first+a[j].first;
if(!binary_search(a,a+n,tmp)) continue;
tmp.first=a[j].first+a[i].second-a[j].second;
tmp.second=a[j].second-a[i].first+a[j].first;
if(!binary_search(a,a+n,tmp)) continue;
ans++;
}
printf("%d\n",ans>>1);
}
return 0;
}