#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<iomanip>
using namespace std;
int n,x[110],y[110],num[110],k[110][110],b[110][110],sum[5000],a=1,ans=0;
void init()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
	for(int i=1;i<=n;i++)
	{
		num[i]=1;
		for(int j=i+1;j<=n;j++)
			if(x[i]==x[j]&&y[i]==y[j])
			{
				num[i]++;
				for(int l=j;l<=n;l++)
				{
					x[l]=x[l+1];
					y[l]=y[l+1];
				}
				j=i+1;
				n--;
			}
	}
}
void count_k()
{
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			if((x[i]==0&&y[i]==0)||(x[j]==0&&y[j]==0)) continue;
			if(x[i]-x[j]==0) continue;
			else
			{
				int c=y[i]-y[j];
				int v=x[i]-x[j];
				k[i][j]=c/v;
				b[i][j]=y[j]-k[i][j]*x[j];
			}
		}
}
void count_sum()
{
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			sum[a]=0;
			for(int p=1;p<=n;p++)
			{
				if(y[p]==k[i][j]*x[p]+b[i][j]) sum[a]+=num[p];
			}
			a++;
		}
	for(int i=1;i<=n;i++) 
	{
		for(int j=1;j<=n;j++)
			if(x[i]==x[j]) sum[a]+=num[j];
		a++;
	}
	for(int i=1;i<=n;i++) 
	{
		for(int j=1;j<=n;j++)
			if(y[i]==y[j]) sum[a]+=num[j];
		a++;
	}
	
}
void count_ans()
{
	for(int i=1;i<=a;i++)
		if(sum[i]>ans) ans=sum[i];
	cout<<ans<<endl;
}
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	init();
	count_k();
	count_sum();
	count_ans();
}