#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <set>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

const int NMAX=1e3+5;
const int VAL=1e4;

set<pair<int,int>>s;
pair<int,int> v[NMAX];

int main()
{
    int n,i,j,kon=0;
    double x,y;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>x>>y;
        x=round(x*VAL);
        y=round(y*VAL);
        pair<int,int>p=make_pair(x,y);
        v[i]=p;
        s.insert(p);
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            if(i==j)
                continue;
            pair<int,int>p1;
            pair<int,int>p2;
            pair<int,int>aux;
            int dist1=v[i].second-v[j].second;
            int dist2=v[j].first-v[i].first;
            p1=make_pair(v[i].first+dist1,v[i].second+dist2);
            p2=make_pair(v[j].first+dist1,v[j].second+dist2);
            if(s.find(p1)!=s.end() && s.find(p2)!=s.end())
                kon++;
        }
    kon/=4;
    cout<<kon;
    return 0;
}