#include<cstdio>
#include<algorithm>
#define maxn 1010
using namespace std;
int matrix[41][41][41][41]={0},n,ans=1;
int A[maxn]={0},B[maxn]={0},C[maxn]={0},D[maxn]={0};
int gcd(int a,int b){
	return b==0?a:gcd(b,a%b);
}
void gcd1(int& a,int& b,int& c,int& d){
	int dx= gcd(a,gcd(b,gcd(c,d)));
	a/=dx; b/=dx; c/=dx; d/=dx;
	return;
}

int cnt(int x,int y){
	int a=A[x]-A[y],b=B[x]-B[y],c=C[x]-C[y],d=D[x]-D[y];
	gcd1(a,b,c,d);
	int num=0;
	int a1=A[x],b1=B[x],c1=C[x],d1=D[x];
	while (1){
		if (!(a1<=40&&b1<=40&&c1<=40&&d1<=40)||!(a1>=0&&b1>=0&&c1>=0&&d1>=0)) break;
		if (matrix[a1][b1][c1][d1]==1)num++;
		a1+=a; b1+=b; c1+=c; d1+=d;
	}
	return num;
}

void read(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d%d%d%d",&A[i],&B[i],&C[i],&D[i]);
		A[i]+=20;
		B[i]+=20;
		C[i]+=20;
		D[i]+=20;
		matrix[A[i]][B[i]][C[i]][D[i]]=1;
	}
}

int main(){
	freopen("xumingshi.in","r",stdin);
	freopen("xumingshi.out","w",stdout);
	read();
	if(!n){
		printf("0");
		return 0;
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			if(i!=j)
			ans=max(ans,cnt(i,j));
		}
	}
	printf("%d",ans);
	return 0;
}