#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int cool(int a);
int x[101],y[101],n;
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	int i,p,ans=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	scanf("%d%d",&x[i],&y[i]);
	
	for(i=1;i<=n;i++)
	 ans=max(ans,cool(i));
	 if(n>=2)
	 ans=max(ans,2);
	 printf("%d",ans);
	 return 0;
}
int cool(int a)
{
	int i,l=0,tmp=0,q=0;
     double k[101];
	 for(i=1;i<=n;i++)
	  {
	  	k[i]=0;
	     if(x[i]==x[a]&&y[i]==y[a])
	      k[++l]=-10000;
	  	 else if(x[i]==x[a])
	  	  k[++l]=9999;
	  	 else
	  	 k[++l]=(y[i]-y[a])/(x[i]-x[a]);
	  }
	 	sort(k+1,k+l+1);
	 	for(i=1;i<=n;i++)
	 	if(k[i]==-10000)
	 	 q++;
	 	 else
	 	 break;
	 	
	 	   i++;int t=1;
		 for(;i<=n;i++)
		 {
	 	  if(k[i]==k[i-1])
	 	    t++;
	 	    else
	 	  {tmp=max(tmp,t+q);t=1;}
	 	 }
	 	 tmp=max(tmp,q);
	 return tmp;	
}