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

print(conclusion)