def main():
    n = int(input())
    c = [list(map(int, input().split())) for _ in range(n)]
    ans = solve(n, c)
    print(ans)

def solve(n, c):
    ans = 0
    for i in range(n):
        for j in range(i):
            x1, y1 = c[i]
            x2, y2 = c[j]
            if x2 -x1 == 0:
                ans = max(ans,line(c, x1))
            else:
                a = (y2 - y1)/(x2 - x1)
                t = y1 - a * x1
                ans = max(ans, linear(c, a, t))
    return ans

def linear(c, a, t):
    ans = 0
    for (x, y) in c:
        if y == a * x + t:
            ans += 1
    return ans

def line(c, a):
    ans = 0
    for (x, y) in c:
        if a == x:
            ans += 1
    return ans


if __name__ == '__main__':
    main()