n = int(input())
xy = [[int(i) for i in input().split()] for j in range(n)]

ans = 0

for i in range(n):
    for j in range(i+1,n):
        if xy[i][0] == xy[j][0]:
            flag = True
            K = 0
            b = 0
        else:
            flag = False
            b = xy[i][1] - xy[i][0] * (xy[i][1]-xy[j][1]) / (xy[i][0]-xy[j][0])
            #K = (xy[i][1]-xy[j][1]) / (xy[i][0]-xy[j][0])
        tmp = 2
        #print(K,b,i,j)
        for k in range(j+1,n):
            if flag == True:
                if xy[k][0] == xy[i][0]:
                    tmp += 1
            elif xy[k][1] == (xy[i][1]-xy[j][1]) / (xy[i][0]-xy[j][0])*xy[k][0]+b:
                tmp += 1
            #print(i,j,k)
        ans = max(ans,tmp)
        
print(ans)