#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<int> X(N), Y(N);
	for (int i = 0; i < N; ++i) {
		cin >> X[i] >> Y[i];
	}
	int ans = 0;
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < i; ++j) {
			int dx = X[j] - X[i], dy = Y[j] - Y[i];
			int cnt = 0;
			for (int k = 0; k < N; ++k) {
				int ex = X[k] - X[i], ey = Y[k] - Y[i];
				if (dx * ey == dy * ex) {
					++cnt;
				}
			}
			ans = max(ans, cnt);
		}
	}
	cout << ans << endl;
	return 0;
}