#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int x[110],y[110];
bool vis[110][110][110];
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	int n,i,j,k,kx,ky,tmpx,tmpy,sx,sy,total=1,ans=-1;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	    scanf("%d%d",&x[i],&y[i]);
	for(i=1;i<=n;i++)
		for(j=i+1;j<=n;j++)
		{
			total=2;
			kx=x[i]-x[j];
			ky=y[i]-y[j];
			for(k=j+1;k<=n;k++)
			{
				if(vis[i][j][k])
					continue;
				vis[i][j][k]=1;
				vis[i][k][j]=1;
				vis[j][i][k]=1;
				vis[j][k][i]=1;
				vis[k][i][j]=1;
				vis[k][j][i]=1;
				tmpx=x[k]-x[i];
				tmpy=y[k]-y[i];
				sx=x[k]-x[j];
				sy=y[k]-y[j];
				if((tmpx*ky == tmpy*kx) && (sx*ky == sy*kx) && (sx*tmpy == sy*tmpx))
					total++;
			}
			ans=max(total,ans);
		}
	printf("%d",ans);
}