#include<fstream.h>
#include<iostream.h>
#include<algorithm>
using namespace std;
struct punct
{
	double x,y;
};
int n,i,j,k,inc=1,sf,xx,yy;
double d[1000010];
punct a[1010];

double mabs(double x)
{
	if(x>=0) return x;
	else
	return -x;
}

int panta( punct p1, punct p2)
{
	double p;
	p=mabs(p1.x-p2.x)/mabs(p1.y-p2.y);
}
	
int main()
{
	ifstream in("trapez.in");
	ofstream out("trapez.out");
	in>>n;
	for(i=1;i<=n;i++)
		in>>a[i].x>>a[i].y;
	for(i=1;i<n;i++)
		for(j=i;j<=n;j++)
			d[++k]=panta(a[i],a[j]);
	sort(d+1,d+k+1);
	inc=1;
	for(i=inc;i<=n;i++)
		if(d[i+1]==d[i])
			sf++;
			else
			{
				sf++;
				xx=sf-inc+1;
				yy=yy+((xx*(xx-1))/2);
				inc=i+1;
				
		}
out<<yy<<endl;
return 0;
}