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

int main()
{
	int n;
	cin >> n;
	vector<pair<int,int>> vp(n);
	for(int i = 0;i<n;i++)
	{
		int x,y;
		cin >> x >> y;
		vp[i] = make_pair(x,y);
	}
	int ans = 0;
	for(int i = 0;i<n;i++)
	{
		for(int j = 0;j<n;j++)
		{
			if(i==j)continue;
			int x = (vp[i].first-vp[j].first);
			int y = (vp[i].second-vp[j].second);
			int cnt = 0;
			for(int k = 0;k <n;k++)
			{
				if(k==i||j==k)continue;
				int X = (vp[k].first-vp[j].first);
				int Y = (vp[k].second-vp[j].second);
				if(y*X==Y*x)cnt++;
			}
			//cout<<cnt<<endl;
			ans = max(ans,cnt+2);
		}
	}
	cout<<ans<<endl;
}