#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<stdio.h>
#include<cstdlib>
#include<iomanip>	//cout<<setiosflags(ios::fixed)<<setprecision(2);
#include<ctime> //double a=(double)clock();	cout<<a<<endl;
#include<vector>
#include<queue>
using namespace std;
inline int read()
{
	int x=0,ff=1;char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-')ff=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return ff*x;
}
int N,temp,ans=0;
struct point
{
	int x,y;
}P[110];
bool mycmp(const point &A,const point &B)
{return A.x<B.x;}
struct line
{
	int k1,k2;
	int stx,sty;
	int sum;
}L[10010];
int cnt=0;
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	N=read();
	for(int i=1;i<=N;i++)
		P[i].x=read(),P[i].y=read();
	sort(P+1,P+1+N,mycmp);
	for(int i=1;i<=N;)
	{
		temp=i;
		while(P[temp].x==P[i].x&&temp<=N)
			temp++;
		ans=max(ans,temp-i);
		i=temp;
	}
	for(int i=1;i<=N;i++)
		for(int j=i+1;j<=N;j++)
		{
			if(P[i].x==P[j].x)
				continue;
			cnt++;
			L[cnt].stx=P[i].x,L[cnt].sty=P[i].y;
			L[cnt].k1=P[j].y-P[i].y;
			L[cnt].k2=P[j].x-P[i].x;
		}
	for(int i=1;i<=N;i++)
		for(int j=1;j<=cnt;j++)
		{
			if((P[i].y-L[j].sty)*L[j].k2==(P[i].x-L[j].stx)*L[j].k1)
				L[j].sum++;
		}
	for(int i=1;i<=cnt;i++)
		ans=max(ans,L[i].sum);
	printf("%d\n",ans);
	fclose(stdin),fclose(stdout);
	return 0;
}