#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int> X( N );
	vector<int> 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 = i + 1; j < N; j++ ) {
			int dx = X[j] - X[i];
			int dy = Y[j] - Y[i];
			int ans1 = 0;
			for( int k = 0; k < N; k++ ) {
				int dx1 = X[k] - X[i];
				int dy1 = Y[k] - Y[i];
				if( dx * dy1 == dy * dx1 ) {
					ans1++;
				}
			}
			ans = max( ans, ans1 );
		}
	}

	cout << ans << endl;
}