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.
numeroPuntos=int(input())
puntos=[]
listaT=[]
for i in range(0,numeroPuntos):
    puntos.append(list(map(int,input().split())))
listaPos=[]
for i in range(0,numeroPuntos):
    punto1=puntos[i]
    #print(punto1)
    #print(str(i)+" corrida")
    j=i+1
    while (j<numeroPuntos):
        punto2=puntos[j]
        #print(punto2)
        k=j+1
        j+=1
        while (k<numeroPuntos):
            punto3=puntos[k]
            #print(punto3)
            #print(punto1,punto2,punto3)
            listaPos.append([punto1,punto2,punto3])
            k+=1
conclusion=0
for i in listaPos:
    puntoA=i[0]
    puntoB=i[1]
    puntoC=i[2]
    #print(puntoA, puntoB, puntoC)
    colinear=(abs((puntoB[0]-puntoA[0]) * (puntoC[1]-puntoA[1]) - (puntoC[0]-puntoA[0]) * (puntoB[1]-puntoA[1])))
    if (colinear!=0):
        conclusion+=1
print(conclusion)