#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#define N 110
using namespace std;
int n,ans=0;
struct point{
	int x,y;
}a[N];
bool K(point a,point b,point c)
{
	if((a.x-b.x)*(a.y-c.y)==(a.x-c.x)*(a.y-b.y))
	  return true;
	return false;
}
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	scanf("%d",&n);
	scanf("%d%d",&a[1].x,&a[1].y);
	bool b=false;
	for(int i=2;i<=n;i++)
	{
	  scanf("%d%d",&a[i].x,&a[i].y);
	  if(a[i].x!=a[i-1].x || a[i].y!=a[i-1].y) b=true;
	}
	if(!b) 
	{
	   cout<<n<<endl;
	   return 0;
	}
	for(int i=1;i<=n;i++)
	  for(int j=1;j<=n;j++)
	  {
	  	 int cnt=0;
	  	 if(a[i].x==a[j].x && a[i].y==a[j].y) continue;
	  	 if(a[i].x==a[j].x)
	  	 {
	  	 	
	  	 	for(int k=1;k<=n;k++)
	  	 	  if(a[k].x==a[i].x)
	  	 	    cnt++;
	  	 	ans=max(ans,cnt);
	  	 }
	  	 else
	  	 {
	  	 	for(int k=1;k<=n;k++)
	  	 	{
	  	 		if(a[k].x==a[i].x && a[k].y==a[i].y) cnt++;
	  	 		else if(a[k].x==a[j].x && a[k].y==a[j].y) cnt++;
	  	 		else if(a[k].x==a[i].x) continue;
	  	 		else
	  	 		{
	  	 			if(K(a[i],a[j],a[k]))
	  	 			  cnt++;
	  	 		}
	  	 	}
	  	 	ans=max(ans,cnt);
	  	  }
	  }
	cout<<ans<<endl;
	return 0;
}
/*
10
0 0
-1 -1
0 1
2 0
3 -1
1 1
2 1
2 2
0 2
-1 3

5
*/