#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

const int maxn=1000+10;
const int INF=0x3f3f3f3f;

struct NB {
	int x, y, z, w;
} a[maxn];
int n, ans;
int vis[44][44][44][44];

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", &a[i].x, &a[i].y, &a[i].z, &a[i].w);
		vis[a[i].x+20][a[i].y+20][a[i].z+20][a[i].w+20]=1;
	}
	
	for(int i=1; i<=n; i++) {
		for(int j=i+1; j<=n; j++) {
			int cnt=2;
			for(int k=-20; k<=20; k++) {
				if(k==a[i].x || k==a[j].x) continue;
				int x1=a[i].x, x2=a[j].x;
				int y1=a[i].y, y2=a[j].y;
				int z1=a[i].z, z2=a[j].z;
				int w1=a[i].w, w2=a[j].w;
				if(x1==x2) break;
				double ru= (double) (k-x1)/(x2-x1);
				int x=k, y=ru*(y2-y1)+y1;
				int z=ru*(z2-z1)+z1, w=ru*(w2-w1)+w1;
				if(vis[x+20][y+20][z+20][w+20]) cnt++;
				
			}
			ans=max(ans, cnt);
		}
	}
	printf("%d\n", ans);
}