N = int(input())
P = []
for k in range(N):
    P.append(list(map(int,input().split())))
ans = 0
x = [set([]) for k in range(101)]

for k in range(N-1):
    for l in range(k+1,N):
        cnt = 2
        for m in range(N):
            if k == m or l == m:
                continue
            if P[k][0] == P[l][0]:
                x[P[k][0]].add(P[k][1])
                x[P[k][0]].add(P[l][1])
            elif P[k][0] == P[m][0]:
                x[P[k][0]].add(P[k][1])
                x[P[k][0]].add(P[m][1])
            elif (P[k][1]-P[l][1])/(P[k][0]-P[l][0]) == (P[k][1]-P[m][1])/(P[k][0]-P[m][0]):
                cnt += 1
        ans = max(ans,cnt)
for e in x:
    ans = max(ans,len(e))
print(ans)