#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1500;
struct node
{
	int x; int y; int z; int w;
} v[maxn];
int n;
int ans=2;
double es=1e-6;
double ABS(double x)
{
	if(x>0) return x;
	return (0-x);
}
int main()
{
	
	freopen("xumingshi.in","r",stdin);
	freopen("xumingshi.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&v[i].x,&v[i].y,&v[i].z,&v[i].w);
	}
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
			{	
				/*int xq=v[i].x; int xhou=v[i].x-v[j].x;
				int yq=v[i].y; int xhou=v[i].y-v[j].y;
				int zq=v[i].z; int xhou=v[i].z-v[j].z;
				int wq=v[i].w; int xhou=v[i].w-v[j].w;*/
				int num=2;
				for(int k=j+1;k<=n;k++)
				{	
					double lam1;double lam2;double lam3;double lam4;
					if(v[i].x!=v[j].x)
					lam1=(v[k].x-v[i].x)/(v[i].x-v[j].x);  
					if(v[i].y!=v[j].y)
					 lam2=(v[k].y-v[i].y)/(v[i].y-v[j].y);
					if(v[i].z!=v[j].z)
					 lam3=(v[k].z-v[i].z)/(v[i].z-v[j].z);
					if(v[i].w!=v[j].w)
					 lam4=(v[k].w-v[i].w)/(v[i].w-v[j].w);
					if(ABS(lam1-lam2)<es&&ABS(lam1-lam3)<es&&ABS(lam1-lam4)<es)
					num++;
				}
				if(num>ans)
				ans=num;
			}
	printf("%d",ans);
	return 0;
}