Vanya got bored and he painted *n* distinct points on the plane. After that he connected all the points pairwise and saw that as a result many triangles were formed with vertices in the painted points. He asks you to count the number of the formed triangles with the non-zero area.
The first line contains integer *n* (1 ≤ *n* ≤ 2000) — the number of the points painted on the plane. 

Next *n* lines contain two integers each *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ( - 100 ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 100) — the coordinates of the *i*-th point. It is guaranteed that no two given points coincide.
n=int(input())
s=n*(n-1)*(n-2)//6
p=[list(map(int,input().split()))for _ in range(n)]
for i in range(n):
	k,l=0,sorted(1e9 if p[i][1]==Y else (p[i][0]-X)/(p[i][1]-Y)for X,Y in p[:i])
	for j in range(1,i):k=k+1 if l[j]==l[j-1]else 0;s-=k
print(s)