from collections import *
from math import *

def f(X, Y):
    if X == 0:
        return 0, 1
    if Y == 0:
        return 1, 0
    g = gcd(X, Y)
    X //= g
    Y //= g
    if X < 0:
        X, Y = -X, -Y
    return X, Y
    

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):
    D = defaultdict(int)
    for j in range(N):
        if i == j:
            continue
        D[f(X[j] - X[i], Y[j] - Y[i])] += 1
    for k, v in D.items():
        ans = max(ans, v)

print(ans + 1)