import math
#dot=[[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
dot=[[2,1],[4,8],[1,2],[3,6]]
def fang_cheng(dot):
    fc=[]
    l=len(dot)
    for i in range(l) :
      
      for j in range(i+1,l):
        
        a=dot[j][0]-dot[i][0]
        b=dot[i][1]-dot[j][1]
        c=dot[i][0]*dot[j][1]-dot[j][0]*dot[i][1]        
        a1=a//gcd(b,a)
        b1=b//gcd(b,a)
        c1=c/gcd(b,a)
        
        fc.append([a1,b1,c1])
                   
    return fc

def gcd(m,n):
  if n==0:
    return m
  return gcd(n,m%n)

def max_dot(lt):
  max=0
  for i in range(len(lt)):
    c=1
    for j in range(i+1,len(lt)):
      if lt[i][0]==lt[j][0] and lt[i][1]==lt[j][1] and lt[i][2]==lt[j][2]:
        c+=1
    if c>max:
      max=c
  return (1+int(math.sqrt(1+8*max)))//2
      
      
      
    
aa=fang_cheng(dot)
print(aa)


cc=max_dot(aa)
print(cc)