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.

import math 
import sys

def main(arr):
  

  

  ans=math.comb(len(arr),3)
  for i in range(len(arr)):
    x1,y1=arr[i]
    points={}
    for j in range(i+1,len(arr)):

      

      x2,y2=arr[j] 
      i1,i2=(1,0)
      if x2-x1!=0:
        i1,i2=y2-y1,x2-x1 
        if i1<=0:
          i1*=-1 
          i2*=-1 
        g=math.gcd(abs(i1),abs(i2))
        
        i1//=g 
        i2//=g 
      
      if (i1,i2) not in points:
        points[(i1,i2)]=0
      points[(i1,i2)]+=1 
    
    for e in points:
      ans-=math.comb(points[e],2)
  return ans
  

n=int(input())
arr=[]
for i in range(n):
  arr.append(list(map(int,input().split())))
print(main(arr))




        


      
      