import Control.Monad

solve n ps = maximum [f (p, q) | p<-ps, q<-ps, p/=q] where
  f ((x1, y1), (x2, y2)) = length $ filter g ps where
    g (x, y) = (x2 - x1) * (y - y1) == (y2 - y1) * (x - x1)

main = do
  n <- readLn
  ps <- replicateM n $
    (\[x,y]->(x,y)).map read.words <$> getLine
  print $ solve n ps