#include <iostream>

using namespace std;

const int MAXN=1001;

struct Stars
{
	int x,y;
};

int N,Ans;
Stars S[MAXN];
int F[MAXN][MAXN];

void init()
{
	int i;
	freopen("stars.in","r",stdin);
	freopen("stars.out","w",stdout);
	scanf("%d",&N);
	for (i=1;i<=N;i++)
	{
		scanf("%d%d",&S[i].x,&S[i].y);
	}
}

bool inline inl(int i,int j,int k)
{
	return (S[i].x-S[k].x)*(S[i].y-S[j].y)==(S[i].x-S[j].x)*(S[i].y-S[k].y);
}

void dynamic()
{
	int i,j,k;
	for (i=1;i<=N;i++)
	{
		for (j=1;j<=i-1;j++)
		{
			F[i][j]=1;
			for (k=1;k<=j-1;k++)
			{
				if (inl(i,j,k) && F[j][k] + 1>F[i][j])
				{
					F[i][j]=F[j][k]+1;
				}
			}
			if (F[i][j]>Ans)
				Ans=F[i][j];
		}
	}
	Ans++;
}

int main()
{
	init();
	dynamic();
	cout << Ans;
	return 0;
}