#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#include<iostream>
#include<cstring>
using namespace std;
struct N{
	double x,y;
}a[110];
int n,m;
int maxx;
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++)
	 cin>>a[i].x>>a[i].y;
	int ans=0;
    for (int i=1;i<=n;i++)
     for (int j=1;j<=n;j++)
    {
     	double p,q;
		int v1=0,v2=0;
     	if (i!=j)
     	{
     		maxx=2;
     		if (a[i].x==a[j].x&&a[i].y!=a[j].y)
     		{
     			p=a[i].x,v1=0;
			}
			else if (a[i].y!=a[j].y&&a[i].x!=a[j].x)
			{
				p=(a[j].y-a[i].y)/(a[j].x-a[i].x);
				v1=1;
			}
			else if (a[j].y==a[i].y&&a[i].x!=a[j].x)
			{
				p=0;
				v1=2;
			}
			else 
			{
				p=0,v1=3;
			}
			for (int k=1;k<=n;k++)
			{
				if (k!=i&&j!=k)
				{
					if (a[k].x==a[j].x&&a[k].y!=a[j].y)
     				{
     					q=a[k].x,v2=0;
					}
					else if (a[k].y!=a[j].y&&a[k].x!=a[j].x)
					{
						q=(a[j].y-a[k].y)/(a[j].x-a[k].x);
						v2=1;
					}
					else if (a[j].y==a[k].y&&a[k].x!=a[j].x)
					{
						q=0;
						v2=2;
					}
					else 
					{
						q=0,v2=3;
					}
					if (p==q&&v1==v2)
					 maxx++;
				}
			}
	   }
	   ans=max(ans,maxx);
	}
	cout<<ans;
	return 0;
}