#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cctype>
#include<algorithm>
#include<cmath>
using namespace std;
struct r
{
int x;
int y;
}p[110];
int n,m[110][110],i,j,k;
int main()
{
	freopen("asm_fuel.in","r",stdin);
	//freopen("asm_fuel.out","w",stdout);
	int MAX;
	cin>>n;
	for(i=1;i<=n;i++)
		cin>>p[i].x>>p[i].y;
for(i=1;i<=n;i++)
	for(j=2;j<=n;j++)
	{
		m[i][j]=2;
		for(k=1;k<=n;k++)
		    {
			if(k!=i&&k!=j){if(double(p[i].x-p[j].x)/double(p[i].y-p[j].y)==double(p[i].x-p[k].x)/double(p[i].y-p[k].y))
				m[i][j]++;}
			if(m[i][j]>MAX)MAX=m[i][j];
			}

    }

cout<<MAX;
return 0;


}