#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const int MAXN=110,oo=200000000;
int N;
struct xy{
	int x,y;
}a[MAXN];
int Max=-1000,sum=0;
double k,b;
int tm1,tm2;
void work(int t1,int t2){
	sum=2;//两点 确定一直线
	if(a[t1].x==a[t2].x){//竖直,无斜率
		for(int i=1; i<=N; i++){
			if(i==t1||i==t2)continue;
			if(a[i].x==a[t1].x)sum++;
		}
	}
	else{
		k=1.0*(a[t1].y-a[t2].y)/(a[t1].x-a[t2].x);
		b=a[t1].y-1.0*k*a[t1].x;
		//printf("%d %d :",t1,t2);
		//cout<<k<<' '<<b<<endl;
		for(int i=1; i<=N; i++){
			if(i==t1||i==t2)continue;
			if(abs(a[i].x*k+b-a[i].y)<=0.00000001)sum++;
		}
	}
	if(sum>Max)Max=sum;
	//cout<<sum<<endl;
	return;
}
int main(){
	freopen("asm_fuel.in","r",stdin);
	freopen("asm_fuel.out","w",stdout);
	
	cin>>N;
	for(int i=1; i<=N; i++)scanf("%d%d",&a[i].x,&a[i].y);
	for(int i=1; i<N; i++)
		for(int j=i+1; j<=N; j++){
			if(a[i].x==a[j].x&&a[i].y==a[j].y)//重点
				continue;
			else	work(i,j);
		}
	cout<<sum<<endl;
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}
/*
	abs
*/