import math
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

n = I()
p = []
for i in range(n):
    a, b = MI()
    p.append([a, b])

ans = 2
for i in range(n-2):
    for j in range(i+1, n-1):
        cnt = 2
        for k in range(j+1, n):
            if (p[k][0]-p[j][0])*(p[j][1]-p[i][1]) == (p[k][1]-p[j][1])*(p[j][0]-p[i][0]):
                cnt += 1
        ans = max(ans, cnt)

print(ans)