#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri();
	int x[n], y[n];
	for (int i = 0; i < n; i++) x[i] = ri(), y[i] = ri();
	int res = 0;
	for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) {
		int dx = x[i] - x[j];
		int dy = y[i] - y[j];
		int cnt = 2;
		for (int k = 0; k < n; k++) if (k != i && k != j && dx * (y[k] - y[j]) == dy * (x[k] - x[j])) cnt++;
		res = std::max(res, cnt);
	}
	printf("%d\n", res);
	return 0;
}