#include <iostream>
#include <fstream>
#define DIM 1000005
#include <algorithm>
using namespace std;
ifstream f("trapez.in");
ofstream g("trapez.out");
struct punct
{
    double x,y;
}b[1001];
struct panta1
{
    double p; bool ok;
}a[DIM];
int n,nr;
void panta(int i,int j)
{
    ++nr;
    if(b[i].x==b[j].x){ a[nr].p=0; a[nr].ok=1; return;}
    a[nr].ok=0;
    a[nr].p=double((b[i].y-b[j].y)/(b[i].x-b[j].x));
}
inline bool cmp(panta1 a,panta1 b)
{if(a.p==0&&b.p==0)return a.ok<b.ok; return a.p<b.p;}
void solve()
{
    f>>n;
    for(int i=1;i<=n;i++)
    {
        f>>b[i].x>>b[i].y;
        for(int j=i-1;j>=1;j--)
            panta(i,j);
    }
    sort(a+1,a+nr+1,cmp);
    int k=1; long long sol=0;
    for(int i=2;i<=nr;i++)
        if(a[i].p==a[i-1].p&&a[i].ok==a[i-1].ok)
            ++k;
        else
        {
            sol+=k*(k-1)/2;
            k=1;
        }
    g<<sol;
}
int main()
{
    solve();
    return 0;
}