n = int(input())
x, y = [0] * n, [0] * n
for i in range(n):
    x[i], y[i] = map(int, input().split())
ans = 0
for i in range(n):
    for j in range(i + 1, n):
        tmp = 0
        # 直線は傾き同じ。x3-x1*y2-y1=x2-x1*y3-y1
        for k in range(n):
            if (x[k] - x[i]) * (y[j] - y[i]) == (y[k] - y[i]) * (x[j] - x[i]):
                tmp += 1
        ans = max(ans, tmp)
print(ans)