n = int(input())
spot = []
for i in range(n):
    x,y = map(int,input().split())
    spot.append((x,y))
ans = 0
for i in range(n-1):
    for j in range(i+1, n):
        p1 = spot[i]
        p2 = spot[j]
        if p1[0] != p2[0]:
            a = (p2[1]-p1[1])/(p2[0]-p1[0])
            cnt = 2
            for k in range(j+1, n):
                p = spot[k]
                if a*(p[0]-p1[0]) + p1[1] == p[1]:
                    cnt += 1
        else:
            cnt = 2
            for k in range(j+1,n):
                p = spot[k]
                if p1[0] == p[0]:
                    cnt += 1
        ans = max(ans, cnt)
print(ans)