#include <cstdio>
#include <iostream>
using namespace std;
double xi[110],yi[110];
int n;
void read()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%lf%lf",&xi[i],&yi[i]);
}
double ki,bi;
double f(double x1)
{
	return ki*x1+bi;
}
void solve()
{
	int ans;
	int maxn=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			ans=0;
			if(xi[i]==xi[j])
				ki=0;
			else
				ki=(yi[i]-yi[j])/(xi[i]-xi[j]);
			bi=yi[i]-ki*xi[i];
			for(int k=1;k<=n;k++)
			{
				double au=f(xi[k]);
				if(au==yi[k])
					ans++;
			}
			if(ans>maxn)
				maxn=ans;
		}
	}
	printf("%d\n",maxn);
}
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	read();
	solve();
	return 0;
}