#include <bits/stdc++.h>
using namespace std;
ifstream fin("triang.in");
ofstream fout("triang.out");

int n,cnt;
double x,y;
vector<complex<double> >V;

bool cmp(complex<double> a, complex<double> b){
    if(real(a)==real(b)){
        return imag(a)<imag(b);
    }
    else return real(a)<real(b);
}

int main()
{
    fin>>n;
    V.resize(n+1);
    V[0]=complex<double>(INT_MIN,INT_MIN);
    for(int i=1;i<=n;i+=1){
        fin>>x>>y;
        V[i]=complex<double>(x,y);
    }
    sort(V.begin(),V.end(),cmp);
    for(int i=1;i<n-1;i+=1)
    for(int j=i+1;j<n;j+=1){
        double d=sqrt(norm(V[i]-V[j]));
        int left0=j+1;
        int right0=n;
        while(left0<=right0){
            int m=(left0+right0)/2;
            double d0=sqrt(norm(V[m]-V[i]));
            double d1=sqrt(norm(V[m]-V[j]));
            if(abs(d0-d)<0.001&&abs(d1-d)<0.001){
                cnt+=1;
                break;
            }
            else{
                if(d0<d)
                    left0=m+1;
                else
                    right0=m-1;
            }
        }
    }
    fout<<cnt;
    return 0;
}