#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n,ans=1;
struct line{
	int x,y;
}a[110];
int main()
{
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d%d",&a[i].x,&a[i].y);
	for(int i=2;i<=n;i++)
	{
		if(a[i].x!=a[i-1].x)
		break;
		if(i==n)
		{
			printf("%d",n);
			return 0;
		}
	}
	for(int i=1;i<n;i++)
	for(int j=i+1;j<=n;j++)
	{
		int cnt=0;
		if(a[i].x==a[j].x&&a[i].y==a[j].y)
		continue;
		int dx=a[i].x-a[j].x;
		int dy=a[i].y-a[j].y;
		for(int k=1;k<=n;k++)
		{
			if(a[k].x==a[i].x&&a[k].y==a[i].y)
			{
				cnt++;
				continue;
			}
			int dx1=a[i].x-a[k].x;
			int dy1=a[i].y-a[k].y;
			if(dx*dy1==dy*dx1)
			cnt++;
		}
		ans=max(ans,cnt);
	}
	printf("%d",ans);
	return 0;
}