//#include<algorithm>
//using namespace std;
#include<stdio.h>
short n;
double x[1001],y[1001];
int cautbin(double nrx,double nry){
	int st,dr,m;
	for(st=1,dr=n; st<=dr; ){
		m=(st+dr)/2;
		if(x[m]<nrx)
			st=m+1;
		else if(x[m]>nrx)
			dr=m-1;
		else if(x[m]==nrx){
			if(y[m]<nry)
				st=m+1;
			else if(y[m]>nry)
				dr=m-1;
			else if(y[m]==nry)
				return 1;}}
	return 0;}
double abs(double nrx){
	if(nrx<0)
		return -nrx;
	return nrx;}
void sort(){
	int i,j;
    double aux;
	for(i=1; i<n; ++i)
		for(j=i+1; j<=n; ++j)
			if(x[i]>x[j]){
				aux=x[i];
				x[i]=x[j];
				x[j]=aux;
				aux=y[i];
				y[i]=y[j];
				y[j]=aux;}
			else if(x[i]==x[j]&&y[i]>y[j]){
				aux=y[i];
				y[i]=y[j];
				y[j]=aux;}}
void solve(){
	int i,j,k;
	double dx,dy,mijx,mijy;
	scanf("%d",&n);
	for(i=1; i<=n; ++i)
		scanf("%lf%lf",&x[i],&y[i]);
	sort();
	for(i=1,k=0; i<n; ++i)
		for(j=i+1; j<=n; ++j){
			mijx=(x[i]+x[j])/2;
			mijy=(y[i]+y[j])/2;
			dx=abs(mijx-x[i]);
			dy=abs(mijy-y[i]);
			if((y[i]<y[j]&&cautbin(mijx+dy,mijy-dx)&&cautbin(mijx-dy,mijx+dx))||(y[i]>=y[j]&&cautbin(mijx-dy,mijy-dx)&&cautbin(mijx+dy,mijx+dx)))
				++k;}
	printf("%d",k);}
int main(){
	freopen("patrate3.in","r",stdin);
	freopen("patrate3.out","w",stdout);
	solve();
	return 0;}