#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define iii 111

using namespace std;
struct oup {int x,y,num;}pnt[iii],cmp[iii];

bool comp (oup a,oup b)
{
	if (a.x==b.x) return a.y<=b.y;
	return a.x<=b.x;
}
int main ()
{
	freopen ("asm_fuel.in","r",stdin);
	freopen ("asm_fuel.out","w",stdout);
	int n,ans=-1,X,Y,tmp;
	scanf ("%d",&n);
	for (int i=1;i<=n;i++)
		scanf ("%d%d",&cmp[i].x,&cmp[i].y);
	sort (cmp+1,cmp+n+1,comp);
	int o=0;
	for (int i=1;i<=n;i++)
	{
		if (cmp[i].x==cmp[i-1].x&&cmp[i].y==cmp[i-1].y&&i>1)
			pnt[o].num++;
		else
		{
			pnt[++o].x=cmp[i].x;
			pnt[o].y=cmp[i].y;
			pnt[o].num=1;
		}
		ans=max(ans,pnt[o].num);
	}
	for (int i=1;i<=o;i++)
		for (int j=1;j<=o;j++)
		if (i!=j)
		{
			Y = pnt[i].y - pnt[j].y ;
			X = pnt[i].x - pnt[j].x ;
			tmp = pnt[i].num + pnt[j].num ;
			for (int k=1;k<=o;k++) if (i!=k && j!=k)
			if (X==0 && pnt[k].x==pnt[i].x)
				tmp+=pnt[k].num;
			else if ((pnt[k].y-pnt[i].y)*X==(pnt[k].x-pnt[i].x)*Y)
				tmp+=pnt[k].num;
			ans=max(ans,tmp);
		}
	printf ("%d\n",ans);
	return 0;
}