#include <fstream>
#include <algorithm>

#define NMax 1100
using namespace std;
fstream f("trapez.in");
ofstream g("trapez.out");
struct punct {
    int x;
    int y;
}p[NMax];
int n, k, parox, i ,j, nr=0;
long long nrtr;
long double pante[NMax*NMax];
int main()
{
    f>>n;
    for (i=1; i<=n; i++)
        f>>p[i].x>>p[i].y;
    for (i=1; i<=n; i++)
        for (j=i+1; j<=n; j++)
            if(p[i].x-p[j].x==0)
                parox++;
            else
                pante[++k]=(long double) 1.0*(p[i].y-p[j].y)/(p[i].x-p[j].x);
    
    
    sort(pante+1, pante+k+1);
    for (i=1; i<=k; i++) {
        if(pante[i]==pante[i-1])
            nr++;
        else {
            nrtr+=nr*(nr-1)/2;
            nr=1;
        }
    }
    nrtr+=parox*(parox-1)/2;
    g<<nrtr;
    return 0;
}