import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines n = int(input()) xy = map(int, read().split()) XY = list(zip(xy, xy)) par = [-1] * (n + 1) # union-find # xの根を求める def find(x): if par[x] < 0: return x else: par[x] = find(par[x]) return par[x] # xとyの属する集合の併合 def unite(x, y): x = find(x) y = find(y) if x == y: return False else: # sizeの大きい方をxとする if par[x] > par[y]: x, y = y, x par[x] += par[y] par[y] = x return True # xとyが同じ集合か判定 def same(x, y): return find(x) == find(y) def size(x): return -par[find(x)] # 初期化 # 根なら-size、子なら親の頂点 if n >= 3: for i in range(n - 2): for j in range(i + 1, n): for k in range(j + 1, n): xi, yi = XY[i] xj, yj = XY[j] xk, yk = XY[k] dx1 = xi - xj dy1 = yi - yj dx2 = xj - xk dy2 = yj - yk if dx1 * dy2 == dx2 * dy1: unite(i, j) unite(j, k) ans = 2 for i in range(1, n + 1): ans = max(ans, size(i)) print(ans) elif n == 2: print(2) else: print(1)