#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;

ifstream in("trapez.in");
ofstream out("trapez.out");

struct PUNCT
{
    int x,y;
};

inline int fact(int n)
{
    if(n==0)
        return 0;
    int ret=1, i;
    for(i=2; i<=n; i++)
        ret*=i;
    return ret;
}

PUNCT x[101000];
long long i,j,n,s,nr,vr;
long double p[305000], *q,k;

bool cmp(double x, double y)
{
    return abs(x-y) <= 0.0001;
}

int main()
{
    in>>n;
    for(i=1; i<=n; i++)
        in>>x[i].x>>x[i].y;

    for(i=1; i<n; i++)
        for(j=i+1; j<=n; j++)
        {
            if(x[i].x == x[j].x)
                {vr++;continue;}
            p[++nr] = (float)(x[i].y-x[j].y)/(x[i].x-x[j].x);
        }
    sort(p+1,p+nr+1);
    n=nr;
    nr = 1;k=p[1];
    for(i=2; i<=n; i++)
    {
        if(p[i] != k)
            s+=(nr-1)*nr/2, nr=0, k=p[i];
        nr++;
    }
    s+=(nr-1)*nr/2;
    if(vr>0)
        s+=vr*(vr-1)/2;
    out<<s;
    
    return 0;
}