# include <bits/stdc++.h>
# define x first
# define y second
using namespace std;
ifstream fi("patrate3.in");
ofstream fo("patrate3.out");
pair < double , double > v[1005];
bool cmp(pair < double , double > a,pair < double , double > b)
{
    if (fabs(a.x - b.x) < 0.0001) return (a.y < b.y);
    return (a.x < b.x);
}
int main(void)
{
    int n;
    fi>>n;
    for (int i=1;i<=n;++i) fi>>v[i].x>>v[i].y;
    sort(v+1,v+1+n,cmp);
    //for (int i=1;i<=n;++i) cout << v[i].x << ' ' << v[i].y << '\n';
    int ans=0;
    for (int i=1;i<=n;++i)
        for (int j=i+1;j<=n;++j)
           if (v[j].x>v[i].x && v[j].y >= v[i].y)
           {
                 pair < double , double > f,g;
                 double dx = v[j].x - v[i].x;
                 double dy = v[j].y - v[i].y;
                 f=v[i];g=v[j];
                 f.x-=dy;g.x-=dy;
                 f.y+=dx;g.x+=dx;
                 ans += (binary_search(v+1,v+1+n,f,cmp) && binary_search(v+1,v+1+n,g,cmp));
            }
     return fo << ans << '\n',0;
}