N = gets.to_i
P = N.times.map { gets.split.map(&:to_i) }.sort_by { |x, y| [x, y] }

ans = 0

(0..N - 2).each do |i|
  (i + 1..N - 1).each do |j|
    d = P[j][0] - P[i][0]
    e = P[j][1] - P[i][1]

    cnt = if d == 0
            P.count { |x, _| P[i][0] == x }
          else
            a = Rational(e, d)
            c = 2

            (j + 1..N - 1).each do |k|
              next if k == i
              next if k == j

              c += 1 if a == Rational(P[k][1] - P[i][1], P[k][0] - P[i][0])
            end

            c
          end

    ans = cnt if ans < cnt
  end
end

puts ans