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.
def isTriangle(i, j, k):
    if i[0] == j[0] and j[0] == k[0] or i[1] == j[1] and j[1] == k[1]:
        return False
    if i[0] == i[1] and j[0] == j[1] and k[0] == k[1]:
        return False
    return True

n =int(input())

l = []
triangles = set()

for _ in range(n):
    m = [int(i) for i in input().split()]
    l.append(m)

for i in range(n):
    for j in range(n):
        if i != j:
            for k in range(n):
                if i != k and j != k:
                    if isTriangle(l[i], l[k], l[j]):
                        triangles.add(tuple(sorted([i, k, j])))

print(len(triangles))