#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define ll long long
using namespace std;
int read()
{
	char ch=getchar();int x=0,f=1;
	while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
struct data{
	int cx,v;
}x[1005],y[1005],z[1005],w[1005];
bool operator < (const data &a,const data &b)
{
	return a.v<b.v;
}
bool operator == ( const data &a,const data &b)
{
	return a.v==b.v;
}
struct point{
	int x,y,z,w;
}p[1005];
int n,xl,yl,zl,wl;

int main()
{
//	freopen("abcd.in","r",stdin);
	freopen("xumingshi.in","r",stdin);
	freopen("xumingshi.out","w",stdout);
	n=read();
	for(int i=1;i<=n;i++)
	{
		p[i].x=read()+20;p[i].y=read()+20;p[i].z=read()+20;p[i].w=read()+20;
	//	cout<<p[i].x<<' '<<p[i].y<<' '<<p[i].z<<' '<<p[i].w<<endl; 
		x[i].cx=i;x[i].v=p[i].x;
		y[i].cx=i;y[i].v=p[i].y;
		z[i].cx=i;z[i].v=p[i].z;
		w[i].cx=i;w[i].v=p[i].w;
	}
	sort(x+1,x+1+n);
	sort(y+1,y+1+n);
	sort(z+1,z+1+n);
	sort(w+1,w+1+n);
	int big=0,ans;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			ans=2;
			for(int k=1;k<=n;k++)
			{
				if(k==i||k==j)continue;
				double lmd=(double) (p[k].x-p[j].x)/(p[i].x-p[j].x);
				if(  p[k].y==p[j].y+ (int) lmd*(p[i].y-p[j].y) && p[j].z+ (int) lmd*(p[i].z-p[j].z) &&p[j].w+ (int) lmd*(p[i].w-p[j].w)   )
					ans++;
			}
			if(big<ans)big=ans;
			
		}
	}
	cout<<big<<endl;
	return 0;
}