#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 1005
using namespace std;
int n,i,j,k,nr,sol,m;
struct nod
{
    long long x;
    long long y;
}v[Nmax],w[Nmax*Nmax];
int cmp(const nod a,const nod b)
{
    return a.x*b.y*1LL<=a.y*b.x*1LL;
}
int main()
{
    freopen("trapez.in","r",stdin);
    freopen("trapez.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    scanf("%lld %lld",&v[i].x,&v[i].y);
    for (i=1;i<n;i++)
    for (j=i+1;j<=n;j++)
    {
        ++nr;
        w[nr].x=v[i].y-v[j].y;
        w[nr].y=v[j].x-v[i].x;
    }
    sort(w+1,w+nr+1,cmp);
    for (i=2;i<=nr;i++)
    if (w[i].x*w[i-1].y==w[i].y*w[i-1].x) m++;
    else {sol=sol+(m*(m+1)/2); m=0;}
    printf("%d",sol);
    return 0;
}