import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from math import gcd
from fractions import Fraction

class Line:
    def __init__(self, x1, y1, x2, y2):
        a, b, c = y2-y1, x1-x2, x2*y1-x1*y2
        if a < 0: a, b, c = -a, -b, -c
        g = gcd(a, gcd(b, c))
        self.a, self.b, self.c = a//g, b//g, c//g

    def online(self, x, y):
        return self.a*x+self.b*y+self.c == 0

    def cross(self, other):
        return Fraction(self.b*other.c-self.c*other.b, self.a*other.b-self.b*other.a)

n = II()
xy = LLI(n)
ans = 2
for i in range(n):
    x1, y1 = xy[i]
    for j in range(i):
        x2, y2 = xy[j]
        l = Line(x1, y1, x2, y2)
        now = 0
        for x, y in xy:
            now += l.online(x, y)
        ans = max(ans, now)

print(ans)