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 = input()
puntos = []
totaltriang = (n*(n-1)*(n-2))/6
for i in range(n):
	a, b = map(int, raw_input().split(" "))
	puntos.append((a, b))
for i in range(n-2):
	puntoI = puntos[i]
	for j in range(i+1, n-1):
		puntoJ = puntos[j]
		for k in range(j+1, n):
			puntoK = puntos[k]
			if (puntoJ[0]-puntoI[0])*(puntoK[1]-puntoI[1])==(puntoK[0]-puntoI[0])*(puntoJ[1]-puntoI[1]):
				totaltriang = totaltriang - 1
print totaltriang
