#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<vector>
using namespace std;
int m,n;
double k,l,maxn=0;
int f[105][105];
long long  dx[105],dy[105];
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>dx[i]>>dy[i];
	for(int i=1;i<=n;i++)
	 for(int j=1;j<=n;j++)
	 if(i!=j)f[i][j]=2;
	for(int i=1;i<=n;i++)
	 for(int j=1;j<=n;j++)
	 {
	 	if(i!=j){
	 		k=(double)(dy[j]-dy[i])/(dx[j]-dx[i]);
	     	for(int jj=1;jj<=n;jj++)
	 	    if(jj!=i&&jj!=j&&(double)(dy[jj]-dy[i])/(dx[jj]-dx[i])==k)
	 	    f[i][j]++;
		 }
	 }
	 for(int i=1;i<=n;i++)
	 for(int j=1;j<=n;j++)
	 if(f[i][j]>maxn)maxn=f[i][j];
	 cout<<maxn<<endl;
	 return 0;
}